Constant time parallel sorting: An empirical view

Journal of Computer and System Sciences

Volumn 67, Issue 1, 2003, Pages 63-91

  Gasarch, William ^a,b   Golub, Evan ^a   Kruskal, Clyde ^a  

^a University of Maryland ^*  (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS;

NONCONSTRUCTIVE ALGORITHMS;

COMPUTER SCIENCE;

EID: 0042020018     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00040-0     Document Type: Article

References (26)

1. S. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1997.
2. N. Alon, Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory, Combinatorica 6 (1986) 207-219.
3. N. Alon, Y. Azar, Sorting, approximate sorting, and searching in rounds, SIAM J. Discrete Math. 1 (1988) 269-280.
4. N. Alon, Y. Azar, U. Vishkin, Tight bounds for parallel comparison sorting, in: Proceedings of the 29th IEEE Symposium on Found. of Comp. Sci. 1988, pp. 502-510.
5. N. Alon, J. Spencer, The Probabilistic Method, Wiley, New York, 1992.
6. B. Bollobás, Sorting in rounds, Discrete Math. 72 (1988) 21-28.
7. B. Bollobás, P. Hell, Sorting and graphs, in: I. Rival (Ed.), Graphs and Orders, D. Reidel Publishing Company, 1985, pp. 169-184.
8. B. Bollobás, M. Rosenfeld, Sorting in one round, Israel J. Math. 38 (1981) 154-160.
9. B. Bollobás, A. Thomason, Parallel sorting, Discrete Appl. Math. 6 (1983) 1-11.
10. H. Davenport, Multiplicative Number Theory, Springer, Berlin, 1980.
11. P. Erdos, A. Renyi, On a problem in the theory of graphs, Publ. Math. Inst. Hungar. Acad. Sci. 7 (1962) 623-631 (in Hungarian).
12. W. Gasarch, E. Golub, C. Kruskal, A survey of constant round parallel sorting, Bull. European Assoc. Theor. Comput. Sci. (BEATCS) 72 (2000) 84-102.
13. E. Golub, Empirical studies in parallel sorting, Ph.D. Thesis, University of MD, College Park, 1999, www.cs.umd.edu/̃egolub/dissert.pdf.
14. R. Haggkvist, P. Hell, Parallel sorting with constant time for comparisons, SIAM J. Comput. 10 (3) (1981) 465-472.
15. R. Haggkvist, P. Hell, Sorting and merging in rounds, SIAM J. Algebraic Discrete Methods 3 (1982) 465-473.
16. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, Morgan Kaufman, Los Altos, CA, 1992.
17. A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261-277.
18. N. Nisan, D. Zuckerman, Randomness is linear in space, J. Comput. Systems Sci. 52 (1) (1996) 43-52 (Earlier version in FOCS93, The title in FOCS93 was More deterministic simulations in Logspace).
19. A.W. Omer Reingold, R. Shaltiel, Extracting randomness via repeated condensing, Technical Report TR 00-059, Electronic Colloquium on Computational Complexity (ECCC), 2000, See www.eccc.unitrier.de/eccc/.
20. N. Pippenger, Sorting and selecting in rounds, SIAM J. Comput. 16 (1987) 1032-1038.
21. N. Pippenger, Personal communication, 2000.
22. S.P.V. Ran Raz, Omer Reingold, Extracting all the randomness and reducing the error in trevisan's extractors, in: Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.
23. J. Spencer, Ten Lectures on the Probabilistic Method, Conference Board of the Mathematical Sciences, Regional Conference Series, AMS and MAA, Providence, RI, 1987.
24. M. Tanner, Explicit construction of concentrators from generalized n-gons, SIAM J. Algebraic Discrete Methods 5 (1984) (Despite the title the main result relates eigenvalues to expanders).
25. L.G. Valiant, Parallelism in comparison problems, SIAM J. Comput. 4 (3) (1975) 348-355.
26. A. Wigderson, D. Zuckerman, Expanders that beat the eigenvalue bound: explicit construction and applications, Combinatorica 19 (1999) 125-138 (Earlier version appeared in STOC93).