Energy trade-offs analysis using equal-energy maps

Abstract Energy consumption has become a factor limiting further progress of supercomputing. Grasping the relationships determining the transformation of energy into computations is often difficult. Therefore, we propose a new method of visualizing the relationships as two-dimensional maps similar to isotherms or isobars in weather maps. Complex models of energy consumption are projected onto two-dimensional maps with isolines representing points of equal energy consumption. As an illustration of the concept, we present isoenergy maps for three models of parallel computations. The first two models are derived from Amdahl’s and Gustafson’s laws of parallel performance. The third model applies to divisible loads representing data-parallel computations in distributed systems. Equal-energy maps for the three models provide qualitative and quantitative insights into the interactions between certain energy-saving approaches, and their consequent limitations.

[1]  Vipin Kumar,et al.  Isoefficiency: measuring the scalability of parallel algorithms and architectures , 1993, IEEE Parallel & Distributed Technology: Systems & Applications.

[2]  Yves Robert,et al.  Divisible Load Scheduling , 2009, Introduction to Scheduling.

[3]  Maciej Drozdowski,et al.  Isoefficiency Maps for Divisible Computations , 2010, IEEE Transactions on Parallel and Distributed Systems.

[4]  Maciej Drozdowski,et al.  Scheduling for Parallel Processing , 2009, Computer Communications and Networks.

[5]  Luca Benini,et al.  System-level power optimization: techniques and tools , 1999, Proceedings. 1999 International Symposium on Low Power Electronics and Design (Cat. No.99TH8477).

[6]  Wu-chun Feng,et al.  The Green500 List: Encouraging Sustainable Supercomputing , 2007, Computer.

[7]  Joanna Berlinska,et al.  Scheduling divisible MapReduce computations , 2011, J. Parallel Distributed Comput..

[8]  David K. Lowenthal,et al.  Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster , 2006, PPoPP '06.

[9]  Jordi Torres,et al.  Energy-efficient and multifaceted resource management for profit-driven virtualized data centers , 2012, Future Gener. Comput. Syst..

[10]  H. V. Jagadish,et al.  Partitioning Techniques for Large-Grained Parallelism , 1988, IEEE Trans. Computers.

[11]  Erez Zadok,et al.  Energy and performance evaluation of lossless file data compression on server systems , 2009, SYSTOR '09.

[12]  P Kogge,et al.  The tops in flops , 2011, IEEE Spectrum.

[13]  Vipin Kumar,et al.  Performance Properties of Large Scale Parallel Systems , 1993, J. Parallel Distributed Comput..

[14]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[15]  Amin Vahdat,et al.  Data Center Switch Architecture in the Age of Merchant Silicon , 2009, 2009 17th IEEE Symposium on High Performance Interconnects.

[16]  Feng Pan,et al.  Exploring the energy-time tradeoff in high-performance computing , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[17]  Samuel H. Fuller,et al.  Computing Performance: Game Over or Next Level? , 2011, Computer.

[18]  John L. Gustafson,et al.  Reevaluating Amdahl's law , 1988, CACM.

[19]  Bharadwaj Veeravalli,et al.  Distributed Image Processing On A Network Of Workstations , 2003 .

[20]  Hsien-Hsin S. Lee,et al.  Extending Amdahl's Law for Energy-Efficient Computing in the Many-Core Era , 2008, Computer.

[21]  Karthick Rajamani,et al.  Designing Energy-Efficient Servers and Data Centers , 2010, Computer.

[22]  Maciej Drozdowski Energy Considerations for Divisible Load Processing , 2009, PPAM.

[23]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[24]  Pawel Wolniewicz,et al.  Out-of-Core Divisible Load Processing , 2003, IEEE Trans. Parallel Distributed Syst..

[25]  Vasudeva Varma,et al.  Dynamic energy efficient data placement and cluster reconfiguration algorithm for MapReduce framework , 2012, Future Gener. Comput. Syst..

[26]  Maciej Drozdowski,et al.  The combinatorics in divisible load scheduling , 2005 .

[27]  Roger W. Hockney The science of computer benchmarking , 1995, Software, environments, tools.

[28]  Shuaiwen Song,et al.  Iso-Energy-Efficiency: An Approach to Power-Constrained Parallel Computation , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[29]  Thomas G. Robertazzi,et al.  Optimizing Computing Costs Using Divisible Load Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[30]  R.H. Katz,et al.  Tech Titans Building Boom , 2009, IEEE Spectrum.

[31]  Kaustav Banerjee,et al.  A Design-Specific and Thermally-Aware Methodology for Trading-Off Power and Performance in Leakage-Dominant CMOS Technologies , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[32]  Pawel Wolniewicz,et al.  Experiments with Scheduling Divisible Tasks in Clusters of Workstations , 2000, Euro-Par.

[33]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[34]  Wu-chun Feng,et al.  Statistical Power and Performance Modeling for Optimizing the Energy Efficiency of Scientific Computing , 2010, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing.

[35]  Gregor von Laszewski,et al.  Towards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster with DVFS , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[36]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[37]  Krste Asanovic,et al.  Energy-aware lossless data compression , 2006, TOCS.

[38]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[39]  Rami G. Melhem,et al.  Minimizing expected energy consumption in real-time systems through dynamic voltage scaling , 2007, TOCS.