Architecture independent analysis of parallel programs

Ananth Grama, Vipin Kumar, Sanjay Ranka, Vineet Singh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


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 languageEnglish (US)
Title of host publicationComputational Science – ICCS 2001 - International Conference, Proceedings
EditorsVassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, Rene S. Renner, C.J. Kenneth Tan
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540422331, 9783540422334
StatePublished - 2001
EventInternational Conference on Computational Science, ICCS 2001 - San Francisco, United States
Duration: May 28 2001May 30 2001

Publication series

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


OtherInternational Conference on Computational Science, ICCS 2001
Country/TerritoryUnited States
CitySan Francisco


Dive into the research topics of 'Architecture independent analysis of parallel programs'. Together they form a unique fingerprint.

Cite this