Fast parallel sorting under LogP: Experience with the CM-5

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 8, 1996, Pages 791-805

  Dusseau, Andrea C ^b   Culler, David E ^b   Schauser, Klaus Erik ^a   Martin, Richard P ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NONE

Author keywords

Algorithm implementation; Communication performance; Communication schedules; Data layout; Massively parallel processing; Models of parallel computation; Performance analysis; Performance prediction; Sorting

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; INFORMATION THEORY; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; PERFORMANCE; SENSITIVITY ANALYSIS; SORTING;

COMMUNICATION PERFORMANCE; COMMUNICATION SCHEDULES; DATA LAYOUT; MASSIVELY PARALLEL PROCESSING; PERFORMANCE ANALYSIS; PERFORMANCE PREDICTION;

PARALLEL PROCESSING SYSTEMS;

EID: 0030216116     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.532111     Document Type: Article

References (26)

1. S. Fortune and J. Wyllie, "Parallelism in Random Access Machines," Proc. 10th Ann Symp. Theory of Computing, pp. 114-118, 1978.
2. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, "LogP: Towards a Realistic Model of Parallel Computation," Fourth ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, May 1993.
3. D.E. Culler, A. Dusseau, S.C. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, and K. Yelick, "Parallel Programming in Split-C," Supercomputing, 1993.
4. G. Blelloch, C. Leiserson, and B. Maggs, "A Comparison of Sorting Algorithms for the Connection Machine CM-2," Proc. ACM Symp. Parallel Algorithms and Architectures, July 1991.
5. K. Batcher, "Sorting Networks and their Applications" Proc. AFIPS Spring Joint Computing Conf., 1986.
6. T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. Computers, Apr. 1985.
7. M. Zagha and G. Blelloch, "Radix Sort for Vector Multiprocessors," Supercomputing, 1991.
8. D. Lenoski, J. Laudon, K. Gharachorloo, W.-D. Weber, A. Gupta, J. Hennessy, M. Horowitz, and M. Lam, "The Stanford Dash Multiprocessor," IEEE Computer, vol. 25, pp. 63-79, Mar. 1992.
9. R.M. Karp, M. Luby, and F. Meyer auf der Heide, "Efficient PRAM Simulation on a Distributed Memory Machine," Proc. 24th Ann. ACM Symp. Theory of Computing, pp. 318-326, May 1992.
10. K. Mehlhorn and U. Vishkin, "Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories," Acta Informatica, vol. 21, pp. 339-374, 1984.
11. R. Cole and O. Zajicek, "The APRAM: Incorporating Asynchrony into the PRAM Model," Proc. Symp. Parallel Architectures and Algorithms, pp. 169-178, 1989.
12. P. Kanellakis and A. Shvartsman, "Efficient Parallel Algorithms Can Be Made Robust," Proc. Eighth Symp. Principles of Distributed Computing, pp. 211-221, 1989.
13. Z.M. Kedem, K.V. Palem, and P.G. Spirakis, "Efficient Robust Parallel Computations," Proc. 22nd Ann. Symp. Theory of Computing, pp. 138-148, 1990.
14. P.B. Gibbons, "A More Practical PRAM Model," Proc ACM Symp. Parallel Algorithms and Architectures, pp. 158-168, ACM, 1989.
15. C.H. Papadimitriou and M. Yannakakis, "Towards an Architecture-Independent Analysis of Parallel Algorithms," Proc. 20th Ann. ACM Symp. Theory of Computing, pp. 510-513, ACM, 1988.
16. A. Bar-Noy and S. Kipnis, "Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 11-22, June 1992.
17. A. Aggarwal, A.K. Chandra, and M. Snir, "On Communication Latency in PRAM Computation," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 11-21, ACM, June 1989.
18. A. Aggarwal, A. K. Chandra, and M. Snir, "Comm. Complexity of PRAMs," Theoretical Computer Science, pp. 3-28, Mar. 1990.
19. C.U. Martel and A. Raghunathan, "Asynchronous PRAMs with Memory Latency," Technical Report, Univ. of California, Davis, 1991.
20. L.G. Valiant, "A Bridging Model for Parallel Computation," Comm. ACM, vol. 33, pp. 103-11, Aug. 1990.
21. T. von Eicken, D.E. Culler, S.C. Goldstein, and K.E. Schauser, "Active Messages: A Mechanism for Integrated Communication and Computation," Proc. 19th Int'l Symp. Computer Architecture, May 1992.
22. C. Shannon and W. Weaver, The Mathematical Theory of Comm., Univ. of Illinois Press: Urbana, 1949.
23. K. Thearling and S. Smith, "An Improved Supercomputer Sorting Benchmark," Technical Report, Thinking Machines Corp., 1991.
24. P. Liu, W. Aiello, and S. Bhatt, "An Atomic Model for Message-Passing," Proc. ACM Symp. Parallel Algorithms and Architectures, 1993.
25. R. Karp, A. Sahay, E. Santos, and K.E. Schauser, "Optimal Broadcast and Summation in the LogP Model," Proc. ACM Symp. Parallel Algorithms and Architectures, June 1993.
26. J.H. Reif and L.C. Valiant, "A Logarithmic Time Sort for Linear Size Networks," J. ACM, vol. 34, pp. 60-76, Jan. 1987.