Towards optimizing energy costs of algorithms for shared memory architectures
Authors:
Open Access
- 13 June 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 157-165
Abstract
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: it must be modeled explicitly. This paper analyzes energy consumption of parallel algorithms executed on shared memory multicore processors. Specifically, we develop a methodology to evaluate how energy consumption of a given parallel algorithm changes as the number of cores and their frequency is varied. We use this analysis to establish the optimal number of cores to minimize the energy consumed by the execution of a parallel algorithm for a specific problem size while satisfying a given performance requirement. We study the sensitivity of our analysis to changes in parameters such as the ratio of the power consumed by a computation step versus the power consumed in accessing memory. The results show that the relation between the problem size and the optimal number of cores is relatively unaffected for a wide range of these parameters.Keywords
This publication has 18 references indexed in Scilit:
- On the Effects of Memory Latency and Bandwidth on Supercomputer Application Performance2007
- Managing energy-performance tradeoffs for multithreaded applications on multiprocessor architectures2007
- Power-performance considerations of parallel computing on chip multiprocessorsACM Transactions on Architecture and Code Optimization, 2005
- Concurrent cache-oblivious b-trees2005
- Towards an energy complexity of computationInformation Processing Letters, 2001
- Communication-Efficient Parallel SortingSIAM Journal on Computing, 1999
- Energy dissipation in general purpose microprocessorsIEEE Journal of Solid-State Circuits, 1996
- Low-power CMOS digital designIEEE Journal of Solid-State Circuits, 1992
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Parallel Prefix ComputationJournal of the ACM, 1980