Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures

Ananth Y. Grama; Anshul Gupta; Vipin Kumar

doi:10.1109/88.242438

Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures

Ananth Y. Grama, Anshul Gupta, Vipin Kumar

Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

250 Scopus citations

Abstract

Isoefficiency analysis helps us determine the best algorithm/architecture combination f or a particular problem without explicitly analyzing all possible combinations under all possible conditions.

Original language	English (US)
Pages (from-to)	12-21
Number of pages	10
Journal	IEEE Parallel and Distributed Technology
Volume	1
Issue number	3
DOIs	https://doi.org/10.1109/88.242438
State	Published - Aug 1993

Bibliographical note

Funding Information:
This work was supported by Army Research Office grant 28408-MA-SDI to the University of Minnesota, and by the Army High Performance Computing Research Center at the University of Minnesota. We also thank Daniel Challou and Tom Nurkkala for their help in preparing this article.

Access

10.1109/88.242438

OpenUrl availability

Full text

Cite this

@article{f0559c5e90a74621b964a4e66ebb8900,

title = "Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures",

abstract = "Isoefficiency analysis helps us determine the best algorithm/architecture combination f or a particular problem without explicitly analyzing all possible combinations under all possible conditions.",

author = "Grama, {Ananth Y.} and Anshul Gupta and Vipin Kumar",

note = "Funding Information: This work was supported by Army Research Office grant 28408-MA-SDI to the University of Minnesota, and by the Army High Performance Computing Research Center at the University of Minnesota. We also thank Daniel Challou and Tom Nurkkala for their help in preparing this article.",

year = "1993",

month = aug,

doi = "10.1109/88.242438",

language = "English (US)",

volume = "1",

pages = "12--21",

journal = "IEEE Parallel and Distributed Technology",

issn = "1063-6552",

publisher = "IEEE Computer Society",

number = "3",

}

TY - JOUR

T1 - Isoefficiency

T2 - Measuring the Scalability of Parallel Algorithms and Architectures

AU - Grama, Ananth Y.

AU - Gupta, Anshul

AU - Kumar, Vipin

N1 - Funding Information: This work was supported by Army Research Office grant 28408-MA-SDI to the University of Minnesota, and by the Army High Performance Computing Research Center at the University of Minnesota. We also thank Daniel Challou and Tom Nurkkala for their help in preparing this article.

PY - 1993/8

Y1 - 1993/8

N2 - Isoefficiency analysis helps us determine the best algorithm/architecture combination f or a particular problem without explicitly analyzing all possible combinations under all possible conditions.

AB - Isoefficiency analysis helps us determine the best algorithm/architecture combination f or a particular problem without explicitly analyzing all possible combinations under all possible conditions.

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

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

U2 - 10.1109/88.242438

DO - 10.1109/88.242438

M3 - Article

AN - SCOPUS:0027649341

SN - 1063-6552

VL - 1

SP - 12

EP - 21

JO - IEEE Parallel and Distributed Technology

JF - IEEE Parallel and Distributed Technology

IS - 3

ER -

Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures

Abstract

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this