An experimental analysis of parallel sorting algorithms

Theory of Computing Systems

Volumn 31, Issue 2, 1998, Pages 135-167

  Blelloch, G E ^a   Leiserson, C E ^b   Maggs, B M ^a   Plaxton, C G ^c   Smith, S J ^d   Zagha, M ^e  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d Pilot Software   (United States)

^e HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

BITONIC SORT; EXPERIMENTAL ANALYSIS; MACHINE MODELING; OPTIMAL PERFORMANCE; PARALLEL MACHINE; PARALLEL SORTING ALGORITHMS; PREDICTED PERFORMANCE; PRIMITIVE OPERATIONS;

COMPUTER SCIENCE;

EID: 0032381422     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000083     Document Type: Article

References (25)

1. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3:1-19, 1983.
2. S. G. Akl. Parallel Sorting Algorithms. Academic Press, Toronto, 1985.
3. K. Batcher. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computing Conference, volume 32, pages 307-314, 1968.
4. G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers. IEEE Transactions on Computers, 27:84-87, 1978.
5. G. E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, Cambridge, MA, 1990.
6. R. Cole. Parallel merge sort. SIAM Journal on Computing, 770-785, 1988.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, and McGraw-Hill, New York, 1990.
8. R. E. Cypher and C. G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 193-203, May 1990.
9. R. E. Cypher and J. L. C. Sanz. Cubesort: A parallel algorithm for sorting N data items with S-sorters. Journal of Algorithms, 13:211-234, 1992.
10. W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the Association for Computing Machinery, 17(3):496-507, 1970.
11. T. Hagerup and C. Rub. A guided tour of Chernoff bounds. Information Processing Letters, 33(6):305-308, 1990.
12. W. L. Hightower, J. F. Prins, and J. H. Reif. Implementations of randomized sorting on large parallel machines. In Proceedings of the Symposium on Parallel Algorithms and Architectures, June 1992.
13. J. S. Huang and Y. C. Chow. Parallel sorting and data partitioning by sampling. In Proceedings of the IEEE Computer Society's Seventh International Computer Software and Applications Conference, pages 627-631, November 1983.
14. L. Johnsson. Combining parallel and sequential sorting on a boolean n-cube. In Proceedings of the International Conference on Parallel Processing, pages 444-448, 1984.
15. F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions in Computers, 34(4):344-354, 1985.
16. T. Leighton and G. Plaxton. A (fairly) simple circuit that (usually) sorts. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 264-274, October 1990.
17. D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the Association for Computing Machinery, 29(3):642-667, 1982.
18. C. G. Plaxton. Efficient computation on sparse interconnection networks. Technical Report STAN-CS-89-1283, Department of Computer Science, Stanford University, September 1989.
19. J. H. Reif and L. G. Valiant. A logarithmic time sort for linear size networks. Journal of the Association for Computing Machinery, 34(1):60-76, 1987.
20. S. R. Seidel and W. L. George. Binsorting on hypercubes with d-port communication. In Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, pages 1455-1461. ACM, New York, January 1988.
21. T. M. Stricker. Supporting the hypercube programming model on mesh architectures (a fast sorter for iWarp tori). In Proceedings of the Symposium on Parallel Algorithms and Architectures, June 1992.
22. K. Thearling and S. Smith. An improved supercomputer sorting benchmark. In Proceedings Supercomputing '92, pages 14-19, November 1992.
23. B. A. Wagar. Hyperquicksort: A fast sorting algorithm for hypercubes. In M. T. Heath, editor, Hypercube Multiprocessors 1987 (Proceedings of the Second Conference on Hypercube Multiprocessors), pages 292-299. SIAM. Philadelphia, PA, 1987.
24. Y. Won and S. Sahni. A balanced bin sort for hypercube multicomputers. Journal of Supercomputing, 2:435-448, 1988.
25. M. Zagha and G. E. Blelloch. Radix sort for vector multiprocessors. In Proceedings Supercomputing '91, pages 712-721, November 1991.