Constant time parallel sorting: an empirical view

Authors:
William Gasarch;Evan Golub;Clyde Kruskal
Affiliations:
Department of Computer Science, University of Maryland, College Park, MD and Institute for Adv. Comp. Stud., University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science, University of Maryland, College Park, MD
Venue:
Journal of Computer and System Sciences
Year:
2003

Citing 10
Cited 2

Eigenvalues, geometric expanders, sorting in rounds, amd Ramsey theory

Combinatorica
Sorting and selecting in rounds

SIAM Journal on Computing
Sorting, approximate sorting, and searching in rounds

SIAM Journal on Discrete Mathematics
Sorting in rounds

Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Expanders that beat the eigenvalue bound: explicit construction and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomness is linear in space

Journal of Computer and System Sciences
Parallel computation: models and methods

Parallel computation: models and methods
Extracting all the randomness and reducing the error in Trevisan's extractors

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Empirical studies in parallel sorting

Empirical studies in parallel sorting

Sorting and Selection with Imprecise Comparisons

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Finding an unknown acyclic orientation of a given graph

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the following problem: If you want to sort n numbers in k (a constant) rounds then how many comparisons-per-round do you need? This problem has been studied carefully and there exist several algorithms and some lower bounds for it. Many of the algorithms are non-constructive. We have embarked on an empirical study of most of the algorithms in the literature, including the non-constructive ones. This paper is an exposition of what we have found. One of our conclusions is that non-constructive algorithms can be useful.