Solving tree problems on a Mesh-connected processor Array
Information and Control
Continuous routing and batch routing on the hypercube
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Efficient parallel algorithms
Information Processing Letters
A bridging model for parallel computation
Communications of the ACM
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
Efficient massively parallel implementation of some combinatorial algorithms
Theoretical Computer Science
List ranking and list scan on the Cray C90
Journal of Computer and System Sciences
Practical parallel list ranking
Journal of Parallel and Distributed Computing
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Ultimate Parallel List Ranking?
HiPC '99 Proceedings of the 6th International Conference on High Performance Computing
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A Simple Optimal List Ranking Algorithm
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
| Hi-index | 0.00 |
The list-ranking problem is considered for parallel computers which communicate through an interconnection network. Each PU holds k nodes of a set of linked lists. A novel randomized algorithm gives a considerable improvement over earlier ones: for a large class of networks and sufficiently large k, it takes only twice the number of steps required by a k-k routing. For hypercubes the condition is k = ω(log2 N). Even better results are achieved for d-dimensional meshes: we show that the ranking time exceeds the routing time only by lower-order terms for all k = ω(d2). We also show that list-ranking requires at least the time required for k-k routing. Thus, the results are within a factor two from optimal, those for meshes even match the lower bound up to lower-order terms.