A comparison of sorting algorithms for the connection machine CM-2

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991

Volumn , Issue , 1991, Pages 3-16

  Bielloch, Guy E ^a   Leiserson, Charles E ^b   Maggs, Bruce M ^c   Plaxton, C Greg ^d   Smith, Stephen J ^e   Zagha, Marco ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c NEC LABORATORIES AMERICA   (United States)

^d UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^e SUN MICROSYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; SORTING; SUPERCOMPUTERS;

BITONIC SORT; COMPUTATIONAL EXPERIMENT; LARGE DATASETS; PARALLEL SORTING ALGORITHMS; PRACTICAL ISSUES; SMALL DATA SET; SORTING ALGORITHM; SPACE EFFICIENT;

COMPUTATIONAL EFFICIENCY;

EID: 85037420457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113379.113380     Document Type: Conference Paper

References (29)

1. A. Aggarwal and M.-D. A. Huang. Network complexity of sorting and graph problems and simulating CRCW PRAMs by interconnection networks. In J. H. Reif, editor, Lecture Notes in Computer Science: VLSI Algorithms and Architectures (AWOC 88), vol. 319, pages 339-350. Springer-Verlag, 1988.
2. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in clogra parallel steps. Combinalorica, 3:1-19,1983.
3. S. G. Akl. Parallel Sorting Algorithms. Academic Press, Toronto, 1985.
4. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer and System Sciences, 18(2): 155-193, April 1979.
5. K. Batcher. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computing Conference, volume 32, pages 307-314,1968.
6. G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers. IEEE Transactions on Computers, C-27:84-87,1978.
7. G. E. Bielloch. Vector Models for Data-Parallel Computing. The MIT Press, 1990.
8. R. Cole. Parallel merge sort. SIAM Journal on Computing, pages 770-785,1988.
9. R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 206-219,1986.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press and McGraw-Hill, 1990.
11. 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.
12. E. Feiten, S. Karlin, and S. Otto. Sorting on a hypercube. Hm 244, Caltech/JPL, 1986.
13. W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM, 17(3):496-507,1970.
14. W. Hoeffding. On the distribution of the number of successes in independenttrials. Annals of Mathematical Statistics, 27:713-721,1956.
15. 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.
16. F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344-354, April 1985.
17. 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.
18. P. P. Li. Parallel sorting on Ametek/S14. Technical report, Ametek Computer Research Division, Arcadia, CA, September 1986.
19. D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the ACM, 29(3):642-667, July 1982.
20. M. S. Paterson. Improved sorting networks with O(logrc) depth. Algoritmica, 5:75-92,1990.
21. C. G. Plaxton. Efficient computation on sparse interconnection networks. Technical Report STAN-CS-89-1283, Stanford University, Department of Computer Science, September 1989.
22. M. J. Quinn. Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge. BIT, 29(2):239-250,1989.
23. S. Rajasekaran and J. H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal on Computing, 18(3):594-607, June 1989.
24. J. H. Reif and L. G. Valiant. A logarithmic time sort for linear size networks. Journal of the ACM, 34(1):60-76, January 1987.
25. S. R. Seidel and W. L. George. Binsorting on hypercubes with d-port communication. In Proceedings of the Third Conference on Hypercube Concurrent Computers, pages 1455-1461, January 1988.
26. P. Varman and K. Doshi. Sorting with linear speedup on a pipelined hypercube. Technical Report TR-8802, Rice University, Department of Electrical and Computer Engineering, February 1988.
27. 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, Philadelphia, PA, 1987. SIAM.
28. B. A. Wagar. Practical Sorting Algorithms for Hypercube Computers. PhD thesis, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, July 1990.
29. Y Won and S. Sahni. A balanced bin sort for hypercube multicomputers. Journal of Supercomputing, 2:435-448,1988.