Modeling Parallel Computers as Memory Hierarchies (1993)
| Venue: | In Proc. Programming Models for Massively Parallel Computers |
| Citations: | 41 - 6 self |
BibTeX
@INPROCEEDINGS{Alpern93modelingparallel,
author = {Bowen Alpern and Larry Carter and Jeanne Ferrante},
title = {Modeling Parallel Computers as Memory Hierarchies},
booktitle = {In Proc. Programming Models for Massively Parallel Computers},
year = {1993},
pages = {116--123},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A parameterized generic model that captures the features of diverse computer architectures would facilitate the development of portable programs. Specific models appropriate to particular computers are obtained by specifying parameters of the generic model. A generic model should be simple, and for each machine that it is intended to represent, it should have a reasonably accurate specific model. The Parallel Memory Hierarchy (PMH) model of computation uses a single mechanism to model the costs of both interprocessor communication and memory hierarchy traffic. A computer is modeled as a tree of memory modules with processors at the leaves. All data movement takes the form of block transfers between children and their parents. This paper assesses the strengths and weaknesses of the PMH model as a generic model. 1 Introduction The raw computing power of multiprocessor computers is exploding. The challenge is to create software that can take advantage of this computing power. The diversit...
