Faster optimal parallel prefix sums and list ranking
Information and Computation
A bridging model for parallel computation
Communications of the ACM
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An introduction to parallel algorithms
An introduction to parallel algorithms
List ranking and list scan on the Cray C-90
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Better trade-offs for parallel list ranking
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Practical parallel list ranking
Journal of Parallel and Distributed Computing
Randomized Parallel List Ranking for Distributed Memory Multiprocessors
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The complexity of parallel computations
The complexity of parallel computations
| Hi-index | 0.00 |
We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGMmo del, and also show the possible gains and limits of such algorithms.