Toward understanding heterogeneity in computing

Arnold L. Rosenberg, Ron C. Chiang
2010 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)  
Heterogeneity complicates the efficient use of multicomputer platforms, but does it enhance their performance? their cost effectiveness? How can one measure the power of a heterogeneous assemblage of computers ("cluster," for short), both in absolute terms (how powerful is this cluster) and relative terms (which cluster is more powerful)? What makes one cluster more powerful than another? Is one better off with a cluster that has one superfast computer and the rest of "average" speed or with a
more » ... luster all of whose computers are "moderately" fast? If you could replace just one computer in your cluster with a faster one, which computer would you choose: the fastest? the slowest? How does one even ask questions such as these in a rigorous, yet tractable manner? A framework is proposed, and some answers are derived, a few rather surprising. Three highlights: (1) If one can replace only one computer in a cluster by a faster one, it is provably (almost) always most advantageous to replace the fastest one. (2) If the computers in two clusters have the same mean speed, then, empirically, the cluster with the larger variance in speed is (almost) always the faster one. (3) Heterogeneity can actually lend power to a cluster! * A portion of this paper appeared at the 24th IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS), 2010.
doi:10.1109/ipdps.2010.5470370 dblp:conf/ipps/RosenbergC10 fatcat:v5iulf4f7zdtjivnehrlhiq7w4