Architecture independent analysis of parallel programs

Ananth Grama; Vipin Kumar; Sanjay Ranka; Vineet Singh

doi:10.1007/3-540-45718-6_65

Architecture independent analysis of parallel programs

Ananth Grama, Vipin Kumar, Sanjay Ranka, Vineet Singh

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

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.

Original language	English (US)
Title of host publication	Computational Science – ICCS 2001 - International Conference, Proceedings
Editors	Vassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, Rene S. Renner, C.J. Kenneth Tan
Publisher	Springer Verlag
Pages	599-608
Number of pages	10
ISBN (Print)	3540422331, 9783540422334
DOIs	https://doi.org/10.1007/3-540-45718-6_65
State	Published - 2001
Event	International Conference on Computational Science, ICCS 2001 - San Francisco, United States Duration: May 28 2001 → May 30 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2074
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	International Conference on Computational Science, ICCS 2001
Country/Territory	United States
City	San Francisco
Period	5/28/01 → 5/30/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Publisher link

10.1007/3-540-45718-6_65

Find It

Find It at U of M Libraries

Cite this

Grama, A., Kumar, V., Ranka, S., & Singh, V. (2001). Architecture independent analysis of parallel programs. In V. N. Alexandrov, J. J. Dongarra, B. A. Juliano, R. S. Renner, & C. J. Kenneth Tan (Eds.), Computational Science – ICCS 2001 - International Conference, Proceedings (pp. 599-608). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074). Springer Verlag. https://doi.org/10.1007/3-540-45718-6_65

Architecture independent analysis of parallel programs. / Grama, Ananth; Kumar, Vipin; Ranka, Sanjay et al.
Computational Science – ICCS 2001 - International Conference, Proceedings. ed. / Vassil N. Alexandrov; Jack J. Dongarra; Benjoe A. Juliano; Rene S. Renner; C.J. Kenneth Tan. Springer Verlag, 2001. p. 599-608 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Grama, A, Kumar, V, Ranka, S & Singh, V 2001, Architecture independent analysis of parallel programs. in VN Alexandrov, JJ Dongarra, BA Juliano, RS Renner & CJ Kenneth Tan (eds), Computational Science – ICCS 2001 - International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2074, Springer Verlag, pp. 599-608, International Conference on Computational Science, ICCS 2001, San Francisco, United States, 5/28/01. https://doi.org/10.1007/3-540-45718-6_65

Grama A, Kumar V, Ranka S, Singh V. Architecture independent analysis of parallel programs. In Alexandrov VN, Dongarra JJ, Juliano BA, Renner RS, Kenneth Tan CJ, editors, Computational Science – ICCS 2001 - International Conference, Proceedings. Springer Verlag. 2001. p. 599-608. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45718-6_65

Grama, Ananth ; Kumar, Vipin ; Ranka, Sanjay et al. / Architecture independent analysis of parallel programs. Computational Science – ICCS 2001 - International Conference, Proceedings. editor / Vassil N. Alexandrov ; Jack J. Dongarra ; Benjoe A. Juliano ; Rene S. Renner ; C.J. Kenneth Tan. Springer Verlag, 2001. pp. 599-608 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2d53fe6ac6d548248a8ed7145f7a377a,

title = "Architecture independent analysis of parallel programs",

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.",

author = "Ananth Grama and Vipin Kumar and Sanjay Ranka and Vineet Singh",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; International Conference on Computational Science, ICCS 2001 ; Conference date: 28-05-2001 Through 30-05-2001",

year = "2001",

doi = "10.1007/3-540-45718-6_65",

language = "English (US)",

isbn = "3540422331",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "599--608",

editor = "Alexandrov, {Vassil N.} and Dongarra, {Jack J.} and Juliano, {Benjoe A.} and Renner, {Rene S.} and {Kenneth Tan}, C.J.",

booktitle = "Computational Science – ICCS 2001 - International Conference, Proceedings",

}

TY - GEN

T1 - Architecture independent analysis of parallel programs

AU - Grama, Ananth

AU - Kumar, Vipin

AU - Ranka, Sanjay

AU - Singh, Vineet

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957888635&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957888635&partnerID=8YFLogxK

U2 - 10.1007/3-540-45718-6_65

DO - 10.1007/3-540-45718-6_65

M3 - Conference contribution

AN - SCOPUS:84957888635

SN - 3540422331

SN - 9783540422334

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 599

EP - 608

BT - Computational Science – ICCS 2001 - International Conference, Proceedings

A2 - Alexandrov, Vassil N.

A2 - Dongarra, Jack J.

A2 - Juliano, Benjoe A.

A2 - Renner, Rene S.

A2 - Kenneth Tan, C.J.

PB - Springer Verlag

T2 - International Conference on Computational Science, ICCS 2001

Y2 - 28 May 2001 through 30 May 2001

ER -

Architecture independent analysis of parallel programs

Abstract

Publication series

Other

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this