Assessing parallel algorithms

Abstract

Various existing performance metrics within the parallel systems domain are analyzed. These include the different flavors of speedup, efficiency, and isoefficiency. Execution time still remains the most widely used metric. A new method to automatically estimate algorithmic cost is provided.