The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Finding Lowest Common Ancestors in Parallel
IEEE Transactions on Computers
Deterministic selection in O(loglog N) parallel time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
IEEE Transactions on Computers
Matching partition a linked list and its optimization
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
Process coordination with fetch-and-increment
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
An Optimal Linked List Prefix Algorithm on a Local Memory Computer
IEEE Transactions on Computers
Sorting with Linear Speedup on a Pipelined Hypercube
IEEE Transactions on Computers
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
A simple architecture for constant time sorting machines
ACM SIGARCH Computer Architecture News
Efficient Routing and Sorting Schemes for de Bruijn Networks
IEEE Transactions on Parallel and Distributed Systems
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
IEEE Transactions on Parallel and Distributed Systems
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On parallel searching (Extended Abstract)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Google's MapReduce programming model — Revisited
Science of Computer Programming
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
IEEE Transactions on Computers
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Google's MapReduce programming model – Revisited
Science of Computer Programming
The average complexity of deterministic and randomized parallel comparison sorting algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A Lower Bound for Oblivious Dimensional Routing
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Oblivious routing in fat-tree based system area networks with uncertain traffic demands
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
| Hi-index | 0.03 |
A variety of models have been proposed for the study of synchronous parallel computation. We review these models and study further some prototype problems. We distinguish two classes of models, fixed connection networks and models based on a shared memory. Routing is the prototype problem for the networks. In particular, routing provides the basis for simulating the more powerful shared memory models. We show that a simple but important class of deterministic strategies (oblivious routing) is necessarily inefficient with respect to worst case analysis. Routing can be viewed as a special case of sorting and the existence of a deterministic O(logn) routing or sorting algorithm for an n processor fixed connection network remains open. However, if we consider the more powerful class of shared memory models, we are -&-ldquo;almost-&-rdquo; able to achieve such an efficient sort via Valiant's parallel merging algorithm. Within a spectrum of models, we show that log log n - log log r is asymptotically optimal for rn processors to merge two sorted lists of n elements.