A Randomized Parallel Sorting Algorithm with an Experimental Study

Journal of Parallel and Distributed Computing

Volumn 52, Issue 1, 1998, Pages 1-23

  Helman, David R ^a   Bader, David A ^b   Jájá, Joseph ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b University of New Mexico   (United States)

Author keywords

Generalized sorting; Integer sorting, sample sort, parallel performance; Parallel algorithms

Indexed keywords

EID: 0039496742     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1462     Document Type: Article

References (32)

1. Alexandrov A., Ionescu M., Schauser K., Scheiman C. LogGP: Incorporating long messages into the LogP model - One step closer towards a realistic model for parallel computation. 7th Annual Symposium on Parallel Algorithms and Architectures. 1995;ACM, Santa Barbara. p. 95-105.
2. Arpaci R. H., Culler D. E., Krishnamurthy A., Steinberg S. G., Yelick K. Empirical evaluation of the CRAY-T3D: A compiler perspective. Proceedings of the 22nd Annual International Symposium on Computer Architecture. 1995;ACM/IEEE, Portofino. p. 320-331.
3. Bader D. A., Helman D. R., JáJá J. Practical parallel algorithms for personalized communication and integer sorting. ACM J. Exp. Algorith. 1:1996;1-42.
4. Bader D. A., JáJá J. Practical parallel algorithms for dynamic data redistribution, median finding, and selection. Proceedings of the 10th International Parallel Processing Symposium. 1996;IEEE Computer Society, Honolulu. p. 292-301.
5. Bader D. A., JáJá J. Parallel algorithms for image histogramming and connected components with an experimental study. J. Parallel Distributed Comput. 35:June 1996;173-190.
6. Bailey D., Barszcz E., Barton J., Browning D., Carter R., Dagum L., Fatoohi R., Fineberg S., Frederickson P., Lasinski T., Schreiber R., Simon H., Venkatakrishnan V., Weeratunga S. Numerical Aerodynamic Simulation Facility Tech. Rep. March 1994.
7. Bala V., Bruck J., Cypher R., Elustondo P., Ho A., Ho C. T., Kipnis S., Snir M. CCL: A portable andtunable collective communication library for scalable parallel computers. IEEE Transactions on Parallel and Distributed Systems. 6:Feb. 1995;154-164.
8. Batcher K. Sorting networks and their applications. Proceedings of the AFIPS Spring Joint Computer Conference 32. 1968;Reston. p. 307-314.
9. Blelloch G. E., Leiserson C. E., Maggs B. M., Plaxton C. G., Smith S. J., Zagha M. A comparison of sorting algorithms for the connection machine CM-2. Proceedings of the Symposium on Parallel Algorithms and Architectures. 1991;ACM, Newport. p. 3-16.
10. Carlson W. W., Draper J. Supercomputing Research Center Tech. Rep. February 1995.
11. Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat. 23:1952;493-509.
12. Cray Research, Inc, October 1994.
13. Culler D. E., Dusseau A., Goldstein S. C., Krishnamurthy A., Lumetta S., von Eicken T., Yelick K. Parallel programming in Split-C. Proceedings of Supercomputing '93. 1993;ACM/IEEE, Portland. p. 262-273.
14. Culler D. E., Dusseau A. C., Martin R. P., Schauser K. E. Fast parallel sorting under LogP: From theory to practice. Proceedings of the Workshop on Portability and Performance for Parallel Processing. 1993;Wiley, Southampton. p. 71.
15. Culler D. E., Karp R. M., Patterson D. A., Sahay A., Schauser K. E., Santos E., Subramonian R., von Eicken T. LogP: Towards a Realistic Model of Parallel Computation. Fourth Symposium on Principles and Practice of Parallel Programming. 1993;ACM SIGPLAN, San Diego. p. 1-12.
16. Dusseau C. Fast parallel sorting under LogP: Experience with the CM-5. IEEE Transa. Parallel Distributed Systems. 7:Aug. 1996;791-805.
17. Hagerup T., Rüb C. A guided tour of Chernoff bounds. Inform. Process. Lett. 33:Feb. 1990;305-308.
18. Hightower W. L., Prins J. F., Reif J. H. Implementations of randomized sorting on large parallel machines. Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures. 1992;ACM, San Diego. p. 158-167.
19. Huang J. S., Chow Y. C. Parallel sorting and data partitioning by sampling. Proceedings of 7th Computer Software and Applications Conference. 1983;. p. 627-631.
20. Leighton F. T. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput. C-34:Apr. 1985;344-354.
21. Li H., Sevcik K. C. Computer Systems Research Institute Tech. Rep. April 1994.
22. Li X., Lu P., Schaeffer J., Shillington J., Wong P. S., Shi H. On the versatility of parallel sorting by regular sampling. Parallel Computing. 19:Oct. 1993;1079-1103.
23. Marberg J. M., Gafni E. Sorting in constant number of row and column phases on a mesh. Algorithmica. 3:1988;561-572.
24. University of Tennesse Tech. Rep. June 1995.
25. Plaxton C. G. Computer Science Tech. Rep. September 1989.
26. Quinn M. J. Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge. BIT. 29:1989;239-250.
27. Reif J. H., Valiant L. G. A logarithmic time sort for linear sized networks. J. ACM. 34:Jan. 1987;60-76.
28. Saini S., Bailey D. H. Numerical Aerodynamic Simulation Facility Tech. Rep. December 1995.
29. Shi H., Schaeffer J. Parallel sorting by regular sampling. J. Parallel Distributed Comput. 14:Apr. 1992;361-372.
30. Tridgell A., Brent R. P. Computer Sciences Laboratory Technical Report. February 1993.
31. Valiant L. G. A bridging model for parallel computation. Commun. ACM. 33:Aug. 1990;103-111.
32. Woo S. C., Ohara M., Torrie E., Singh J. P., Gupta A. The SPLASH-2 programs: characterization andmethodological considerations. Proceedings of the 22nd Annual International Symposium on Computer Architecture. 1995;ACM/IEEE, Portofino. p. 24-36.