The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2005)
Denver, Colorado
Apr. 4, 2005 to Apr. 8, 2005
ISSN: 1530-2075
ISBN: 0-7695-2312-9
pp: 231a
G. Chen , The Pennsylvania State University, University Park
K. Malkowski , The Pennsylvania State University, University Park
M. Kandemir , The Pennsylvania State University, University Park
P. Raghavan , The Pennsylvania State University, University Park
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational workload in such computations across parallel processors, achieving sustained near machine-peak performance with close-to-ideal load balanced computationto-processor mapping is inherently difficult. As a result, most of the time, the loads assigned to parallel processors can exhibit significant variations. While there have been numerous past efforts that study this imbalance from the performance viewpoint, to our knowledge, no prior study has considered exploiting the imbalance for reducing power consumption during execution. Power consumption in large-scale clusters of workstations is becoming a critical issue as noted by several recent research papers from both industry and academia. Focusing on sparse matrix computations in which underlying parallel computations and data dependencies can be represented by trees, this paper proposes schemes that save power through voltage/frequency scaling. Our goal is to reduce overall energy consumption by scaling the voltages/frequencies of those processors that are not in the critical path; i.e., our approach is oriented towards saving power without incurring performance penalties.

G. Chen, K. Malkowski, P. Raghavan and M. Kandemir, "Reducing Power with Performance Constraints for Parallel Sparse Applications," 19th IEEE International Parallel and Distributed Processing Symposium(IPDPS), Denver, CO, 2005, pp. 231a.
176 ms
(Ver 3.3 (11022016))