TY - GEN

T1 - On the energy complexity of parallel algorithms

AU - Korthikanti, Vijay Anand

AU - Agha, Gul

AU - Greenstreet, Mark

N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - For a given algorithm, the energy consumed in executing the algorithm has a nonlinear relationship with performance. In case of parallel algorithms, energy use and performance are functions of the structure of the algorithm. We define the asymptotic energy complexity of algorithms which models the minimum energy required to execute a parallel algorithm for a given execution time as a function of input size. Our methodology provides us with a way of comparing the orders of (minimal) energy required for different algorithms and can be used to define energy complexity classes of parallel algorithms.

AB - For a given algorithm, the energy consumed in executing the algorithm has a nonlinear relationship with performance. In case of parallel algorithms, energy use and performance are functions of the structure of the algorithm. We define the asymptotic energy complexity of algorithms which models the minimum energy required to execute a parallel algorithm for a given execution time as a function of input size. Our methodology provides us with a way of comparing the orders of (minimal) energy required for different algorithms and can be used to define energy complexity classes of parallel algorithms.

UR - http://www.scopus.com/inward/record.url?scp=80155183243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80155183243&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2011.84

DO - 10.1109/ICPP.2011.84

M3 - Conference contribution

AN - SCOPUS:80155183243

SN - 9780769545103

T3 - Proceedings of the International Conference on Parallel Processing

SP - 562

EP - 570

BT - Proceedings - 2011 International Conference on Parallel Processing, ICPP 2011

T2 - 40th International Conference on Parallel Processing, ICPP 2011

Y2 - 13 September 2011 through 16 September 2011

ER -