| Parallel Quicksort: an exploration of concurrent programming in Ada |
| Full text |
 Pdf
(368 KB)
|
| Source
|
ACM SIGAda Ada Letters
archive
Volume II , Issue 2 (September/October 1982)
table of contents
Pages: 61 - 68
Year of Publication: 1982
ISSN:1094-3641
|
|
Author
|
|
Norman H. Cohen
|
Systems and Software Research, Sperry Univac, Blue Bell, Pennsylvania
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 22, Citation Count: 4
|
|
|
 ABSTRACT
We develop an Ada Quicksort program which sorts disjoint subsections of an array concurrently. This exercise reveals pitfalls which Ada programmers using tasks must strive to avoid.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Hoare, C. A. R. Quicksort. <u>Computer Journal 5</u>, No. 4 (April 1962), 10--15
|
| |
3
|
McCarthy, J. Towards a mathematical science of computation. <u>Information Processing 1962: Proceedings of IFIP Congress 62</u>, Cicely M. Popplewell, ed., Munich, August-September 1962. Published by North-Holland Publishing Company, Amsterdam, 1963, 21--28
|
| |
4
|
<u>Reference Manual for the Ada Programming Language: Proposed Standard Document</u>. United States Department of Defense, July 1980
|
 |
5
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
