Computational geometry: an introduction
Computational geometry: an introduction
A bridging model for parallel computation
Communications of the ACM
Introduction to algorithms
An introduction to parallel algorithms
An introduction to parallel algorithms
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
List ranking and list scan on the Cray C-90
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
A Compact Data Structure and Parallel Algorithms for Permutation Graphs
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We report on experiments with graph algorithms which were designed for the coarse grained multicomputer (CGM) model. The implementation was based on the message-passing paradigm and uses PVM and/or MPI as communication interfaces.