Architecture Independent Analysis of Parallel Programs

Get BibTex-formatted data

Author

Ananth Grama, Vipin Kumar, Sanjay Ranka, Vineet Singh

Entry type

article

Abstract

The presence of a universal machine model for serial algorithm design, namely the von Neumann model, has been one of the key ingredients of the success of uniprocessors. The presence of such a model makes it possible for an algorithm to be ported across a wide range of uniprocessors efficiently. Universal algorithm design models proposed for parallel computers however tend to be limited in the range of parallel platforms they can efficiently cover. Consequently, portability of parallel programs is attained at the expense of loss of efficiency. In this paper, we explore desirable and attainable properties of universal models of architecture independent parallel program design. We study various models that have been proposed, classify them based on important machine parameters and study their limitations.

Date

2001

URL

http://www.springerlink.com/content/aq7fbaq1rp2bxwxd/

Booktitle

Computational Science - ICCS 2001

Key alpha

Grama

Pages

599-608

Publisher

Springer Berlin / Heidelberg

Series

Lecture Notes in Computer Science

Volume

2074

Affiliation

Purdue University

Publication Date

2001-00-00

Copyright

2001

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Grama,
	title = "Architecture Independent Analysis of Parallel Programs",
	author = "Ananth Grama, Vipin Kumar, Sanjay Ranka, Vineet Singh",
	year = "2001",
	booktitle = "Computational Science - ICCS 2001",
	pages = "599-608",
	publisher = "Springer Berlin / Heidelberg",
	series = "Lecture Notes in Computer Science",
	volume = "2074",
	abstract = "The presence of a universal machine model for serial algorithm design, namely the von Neumann model, has been one of the key ingredients of the success of uniprocessors. The presence of such a model makes it possible for an algorithm to be ported across a wide range of uniprocessors efficiently. Universal algorithm design models proposed for parallel computers however tend to be limited in the range of parallel platforms they can efficiently cover. Consequently, portability of parallel programs is attained at the expense of loss of efficiency. In this paper, we explore desirable and attainable properties of universal models of architecture independent parallel program design. We study various models that have been proposed, classify them based on important machine parameters and study their limitations.",
	affiliation = "Purdue University",
	copyright = "2001",
	url = "http://www.springerlink.com/content/aq7fbaq1rp2bxwxd/",
}