Models of parallel computation: a survey and synthesis
Maggs, B.M.
Matheson, L.R.
Tarjan, R.E.
Carnegie Mellon Univ., Pittsburgh, PA;
This paper appears in: System Sciences, 1995. Vol. II. Proceedings of the Twenty-Eighth Hawaii International Conference on
Publication Date: 3-6 Jan 1995
Volume: 2,
On page(s): 61-70 vol.2
Meeting Date: 01/03/1995 - 01/06/1995
Location: Wailea, HI, USA
ISBN: 0-8186-6935-7
References Cited: 38
INSPEC Accession Number: 4875240
Digital Object Identifier: 10.1109/HICSS.1995.375476
Current Version Published: 2002-08-06
Abstract
In the realm of sequential computing, the random access machine
has successfully provided an underlying model of computation that has
promoted consistency and coordination among algorithm developers,
computer architects and language experts. In the realm of parallel
computing, however, there has been no similar success. The need for such
a unifying parallel model or set of models is heightened by the greater
demand for performance and the greater diversity among machines. Yet the
modeling of parallel computing still seems to be mired in controversy
and chaos. This paper presents a broad range of models of parallel
computation and the different roles they serve in algorithm, language
and machine design. The objective is to better understand which model
characteristics are important to each design community, in order to
elucidate the requirements of a unifying paradigm. As an impetus for
discussion, we conclude by suggesting a model of parallel computation
which is consistent with a model design philosophy that balances
simplicity and descriptivity with prescriptivity. We present only the
survey of abstract computational models. This introduction should
provide insights into the rich array of relevant issues in other
disciplines
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
