A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Journal of Computer and System Sciences
Towards a single model of efficient computation in real parallel machines
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Branch-and-bound and backtrack search on mesh-connected arrays of processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
Abstract machine models for highly parallel computers
Horizons of Parallel Computation
Proceedings of the International Conference on Future Tendencies in Computer Science, Control and Applied Mathematics
| Hi-index | 0.00 |
The Hierarchical PRAM (H-PRAM) (T. Heywood, S. Ranka, 1992) model is a dynamically partitionable PRAM, which charges for communication and synchronization, and allows parallel algorithms to abstractly represent general locality. We show that the H-PRAM can be implemented efficiently on a two dimensional mesh. We use the Peano indexing scheme to hierarchically partition the mesh. Multiple subPRAMs of the H-PRAM are simulated on irregular submeshes. For an H-PRAM program of cost T, the overall CRCW H-PRAM simulation runs in time constant in T with high probability. The simulation is dynamic, i.e. it does not depend on prior knowledge of a program's specific hierarchical configuration, which may be data dependent.