Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)

Aizu-Wakamatsu, Fukushima, Japan

Mar. 15, 1995 to Mar. 17, 1995

ISBN: 0-8186-7038-X

pp: 257

T. Heywood , Dept. of Comput. Sci., Edinburgh Univ., UK

C. Leopold , Dept. of Comput. Sci., Edinburgh Univ., UK

ABSTRACT

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.

INDEX TERMS

parallel algorithms; random-access storage; parallel architectures; virtual machines; storage management; dynamic randomized simulation; hierarchical PRAMs; H-PRAM; dynamically partitionable PRAM; parallel algorithms; general locality; two dimensional mesh; Peano indexing scheme; irregular submeshes; CRCW H-PRAM simulation; hierarchical configuration; parallel computing

CITATION

T. Heywood and C. Leopold, "Dynamic randomized simulation of hierarchical PRAMs on meshes,"

*Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on(PAS)*, Aizu-Wakamatsu, Fukushima, Japan, 1995, pp. 257.

doi:10.1109/AISPAS.1995.401331

CITATIONS