Referenced Items are not available for this document.
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
Published in:
Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on
Date of Conference: 15-17 Mar 1995
- Page(s):
- 257 - 263
- Meeting Date :
- 15 Mar 1995-17 Mar 1995
- Print ISBN:
- 0-8186-7038-X
- INSPEC Accession Number:
- 4917918
- Conference Location :
- Fukushima
- Digital Object Identifier :
- 10.1109/AISPAS.1995.401331
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
