Isoefficiency: measuring the scalability of parallel algorithms and architectures
- 1 August 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Parallel & Distributed Technology: Systems & Applications
- Vol. 1 (3) , 12-21
- https://doi.org/10.1109/88.242438
Abstract
Isoefficiency analysis helps us determine the best algorithm/architecture combination for a particular problem without explicitly analyzing all possible combinations under all possible conditions.<>Keywords
This publication has 8 references indexed in Scilit:
- Another view on parallel speedupPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Performance Properties of Large Scale Parallel SystemsJournal of Parallel and Distributed Computing, 1993
- The scalability of FFT on parallel computersIEEE Transactions on Parallel and Distributed Systems, 1993
- The consequences of fixed time performance measurementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Scalability of parallel algorithms for the all-pairs shortest-path problemJournal of Parallel and Distributed Computing, 1991
- The Effect of Time Constraints on Scaled SpeedupSIAM Journal on Scientific and Statistical Computing, 1990
- Reevaluating Amdahl's lawCommunications of the ACM, 1988
- Parallel depth first search. Part I. ImplementationInternational Journal of Parallel Programming, 1987