Communication-efficient parallel sorting

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 247-256

  Goodrich, Michael T ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; PARALLEL ALGORITHMS; SORTING;

ARBITRARY NUMBER; ASYMPTOTICALLY OPTIMAL; BULK SYNCHRONOUS PARALLEL; COMMUNICATION ROUNDS; COMPUTATION TIME; PARALLEL SORTING; PROCESSOR COMMUNICATIONS; SORTING ALGORITHM; BULK SYNCHRONOUS PARALLEL MODEL; COMMUNICATION EFFICIENT PARALLEL SORTING;

PARALLEL PROCESSING SYSTEMS;

EID: 0029703426     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237870     Document Type: Conference Paper

References (41)

1. M. Adler, J. W. Byers, and R. M. Karp. Parallel sorting with limited bandwidth. 7th SPAA, 129-136, 1995.
2. A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of PRAMs. T. C. S., 71:3-28, 1990.
3. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in clog n parallel steps. Combinatorica, 3:1-19, 1983.
4. S. G. Akl. Parallel Sorting Algorithms. Academic Press, 1985.
5. K. E. Batcher. Sorting networks and their applications. Proc. 1968 Spring Joint Computer Conf., 307-314, Reston, VA, 1968.
6. G. Bilardi and F. P. Preparata. Lower bounds to processor-time tradeoffs under bounded-speed message propagation. 4th WADS, LNCS 955, 1-12. Springer-Verlag, 1995.
7. D. Bitton, D. J. DeWitt, D. K. Hsiao, and J. Menon. A taxonomy of parallel sorting. ACM Comp. Surveys, 16(3):287-318, 1984.
8. G. E. Bielloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. A comparison of sorting algorithms for the connection machine CM-2. 3rd SPAA, 3-16, 1991.
9. V. Chvátal. Lecture notes on the new AKS sorting network. Report DCS-TR-294, Rutgers Univ., 1992.
10. R. Cole. Parallel merge sort. SIAM J. Comput., 17(4):770-785, 1988.
11. S. A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15:87-97, 1986.
12. 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. 4th ACM Symp. on Princ. and Pract. of Par. Prog., 1-12, 1993.
13. R. Cypher and J. L. C. Sanz. Cubesort: A parallel algorithm for sorting N data items with S-sorters. J. of Algorithms, 13:211-234, 1992.
14. R. E. Cypher and C. G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. J. C. S. S., 47:501-548, 1993.
15. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Khokhar. A randomized parallel 3D convex hull algorithm for course grained multicomputers. 7th SPAA, 27-33, 1995.
16. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. 9th SCG, 298-307, 1993.
17. W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. J. ACM, 17(3):496-507, 1970.
18. A. V. Gerbessiotis and L. G. Valiant. Direct bulksynchronous parallel algorithms. J. of Par. and Dist. Comp., 22:251-267, 1994.
19. P. B. Gibbons. A more practical PRAM model. (1st) SPAA, 158-168, 1989.
20. M. T. Goodrich and S. R. Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM, to appear.
21. W. L. Hightower, J. F. Prins, and J. H. Reif. Implementation of randomized sorting on large parallel machines. 4th SPAA, 158-167, 1992.
22. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
23. R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient pram simulation on distributed machines. 24th STOC, 318-326, 1992.
24. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, 869-941. Elsevier/MIT Press, 1990.
25. R. M. Karp, A. Sahay, E. Santos, and K. E. Schauser. Optimal broadcast and summation in the LogP model. 5th SPAA, 142-153, 1993.
26. C. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. T. C. S., 71:95-132, 1990.
27. F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Trans. on Computers, C-34(4):344-354, 1985.
28. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
29. H. Li and K. C. Sevcik. Parallel sorting by overpartitioning. 6th SPAA 46-56, 1994.
30. Y. Mansour, N. Nisan, and U. Vishkin. Tradeoffs between communication throughput and parallel time. 26th STOC, 372-381, 1994.
31. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 9(1):29-59, 1984.
32. J. M. Nash, P. M. Dew, M. E. Dyer, and J. R. Davy. Parallel algorithm design on the WPRAM model. Report 94.24, School of Comp. Sci., Univ. of Leeds, 1994.
33. D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. J. ACM, 29(3):642-667, 1982.
34. C. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. 20th STOC, 510-513, 1988.
35. M. Paterson. Improved sorting networks with o (log n) depth. Algorithmica, 5(1):75-92, 1990.
36. C. G. Plaxton. Efficient Computation on Sparse Interconnection Networks. PhD thesis, Dept. of Comp. Sci., Stanford Univ., 1989.
37. J. H. Reif. Synthesis of Parallel Algorithms. Morgan Kaufmann, 1993.
38. J. H. Reif and L. G. Valiant. A logarithmic time sort for linear size networks. J. ACM, 34(1):60-76, 1987.
39. H. Shi and J. Schaeffer. Parallel sorting by regular sampling. J. Par. and Dist. Comp., 14:362-372, 1992.
40. L. G. Valiant. A bridging model for parallel computation. Comm. ACM, 33:103-111, 1990.
41. L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, 943-972. Elsevier/MIT Press, 1990.