A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation

ACM Journal of Experimental Algorithmics

Volumn 3, Issue , 1998, Pages 4-

  Helman, David R ^a   JáJá, Joseph ^a   Rader, David A ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b University of New Mexico   (United States)

Author keywords

Generalized Sorting; Integer Sorting; Parallel Algorithms; Parallel Performance; Sorting by Regular Sampling

Indexed keywords

EID: 84979048125     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/297096.297128     Document Type: Article

References (18)

1. Alexandrov, A., Ionescu, M., Schauser, K., and Scheiman, C. LogGP: Incorporating Long Messages into the LogP Model - One step closer towards a realistic model for parallel computation. Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures (Santa Barbara, 1995), pp. 95-105.
2. Arpaci, R., Culler, D., Krishnamurthy, A., Steinberg, S., and Yelick, K. Empirical Evaluation of the CRAY-T3D: A Compiler Perspective. Proc. 22nd Annual International Symposium on Computer Architecture (Santa Margherita Ligure, Italy, 1995), pp. 320-331.
3. Bader, D. A., Helman, D. R., and Jâjâ, J. Practical Parallel Algorithms for Personalized Communication and Integer Sorting. ACM Journal of Experimental Algorithmics 1, 3 (1996), 42 pp. http://www.jea.acm.org/1996/BaderPersonalized/.
4. Bader, D. A. and Jâjâ, J. Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection. Technical Report CS-TR-3494 and UMIACS-TR-95-74 (1995), UMlACS and Electrical Engineering, University of Maryland, College Park, MD. also in Proc. 10th International Parallel Processing Symposium (Honolulu, 1996), pp. 292-301.
5. Bader, D. A. and JÁJÁ, J. Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. Journal of Parallel and Distributed Computing 35, 2 (1996), pp. 173-190.
6. Bala, V., Bruck, J., Cypher, R., Elustondo, P., Ho, A., Ho, C.-T., Kipnis, S., and Snir, M. CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers. IEEE Transactions on Parallel and Distributed Systems 6 (1996), pp. 154-164.
7. Blelloch, C., Leiserson, C., Maggs, B., Plaxton, C., Smith, S., and Zagha, M. A Comparison of Sorting Algorithms for the Connection Machine CM-2. Proc. ACM Symposium on Parallel Algorithms and Architectures (1991), pp. 3-16. To appear in the Communications of the ACM.
8. Carlson, W. and Draper, J. AC for the T3D. Technical Report SRC-TR-95-141 (1995), Supercomputing Research Center, Bowie, MD.
9. Cray Research, Inc. SHMEM Technical Note for C. Cray Research, Inc. Revision 2.3, 1994.
10. Culler, D., Dusseau, A., Goldstein, S., Krishnamurthy, A., Lumetta, S., von Eicken, T., and Yelick, K. Parallel Programming in Split-C. Proc. Supercomputing ’93 (Portland, 1993), pp. 262-273.
11. Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K., Santos, E., Subramonian, R., and von Eicken, T. LogP: Towards a Realistic Model of Parallel Computation. Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (1993).
12. Gerbessiotis, A. Data for Regular Sorting. Personal Communication, 1996.
13. Gerbessiotis, A. and Siniolakis, C. Deterministic Sorting and Randomized Median Finding on the BSP Model. Proc. 8th Annual ACM Symposium on Parallel Algorithms and Architectures (Padua, Italy, 1996), pp. 223-232.
14. Helman, D. R., Bader, D. A., and Jâjâ, J. A Randomized Parallel Sorting Algorithm With an Experimental Study. Technical Report CS-TR-3669 and UMIACS-TR-96-53 (1996), UMIACS and Electrical Engineering, University of Maryland, College Park, MD. To appear in the Journal of Parallel and Distributed Computing.
15. Li, X., Lu, P., Schaepper, J., Shillington, J., Wong, P., and Shi, H. On the Versatility of Parallel Sorting by Regular Sampling. Parallel Computing 19, 1993, pp. 1079-1103.
16. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard. Technical report (1994), University of Tennessee, Knoxville, TN. Version 1.1.
17. Shi, H. and Schaepper, J. Parallel Sorting by Regular Sampling. Journal of Parallel and Distributed Computing 14, 1992, pp. 361-372.
18. Valiant, L. A Bridging Model for Parallel Computation. Communications of the ACM 33, 8 (1990), pp. 103-111.