A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Algorithms
Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
VLSI Algorithms and Architectures
Sorting in c log n parallel steps
Combinatorica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
SIAM Journal on Computing
Adaptive bitonic sorting: an optimal parallel algorithm for shared-memory machines
SIAM Journal on Computing
A simple parallel tree contraction algorithm
Journal of Algorithms
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Optimal merging and sorting on the EREW PRAM
Information Processing Letters
Introduction to algorithms
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Parallel tree contraction part 2: further applications
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Cost Trade-offs in Graph Embeddings, with Applications
Journal of the ACM (JACM)
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We present optimal algorithms for sorting on parallel CREW and EREW versions of the pointer machine model. Intuitively, one can view our methods as being based on a parallel mergesort using linked lists rather than arrays (the usual parallel data structure). We also show how to exploit the “locality” of our approach to solve the set expression evaluation problem, a problem with applications to database querying and logic-programming in O(log n) time using O(n) processors. Interestingly, this is an asymptotic improvement over what seems possible using previous techniques.