TY - GEN
T1 - Energy efficient application mapping to NoC processing elements operating at multiple voltage levels
AU - Ghosh, Pavel
AU - Sen, Arunabha
AU - Hall, Alexander
PY - 2009
Y1 - 2009
N2 - An efficient technique for mapping application tasks to heterogeneous processing elements (PEs) on a Network-on-Chip (NoC) platform, operating at multiple voltage levels, is presented in this paper. The goal of the mapping is to minimize energy consumption subject to the performance constraints. Such a mapping involves solving several sub-problems. Most of the research effort in this area often address these subproblems in a sequential fashion or a subset of them. We take a unified approach to the problem without compromising the solution time and provide techniques for optimal and heuristic solutions. We prove that the voltage assignment component of the problem itself is NP-hard and is inapproximable within any constant factor. Our optimal solution utilizes a Mixed Integer Linear Program (MILP) formulation of the problem. The heuristic utilizes MILP relaxation and randomized rounding. Experimental results based on E3S benchmark applications and a few real applications show that our heuristic produces near-optimal solution in a fraction of time needed to find the optimal.
AB - An efficient technique for mapping application tasks to heterogeneous processing elements (PEs) on a Network-on-Chip (NoC) platform, operating at multiple voltage levels, is presented in this paper. The goal of the mapping is to minimize energy consumption subject to the performance constraints. Such a mapping involves solving several sub-problems. Most of the research effort in this area often address these subproblems in a sequential fashion or a subset of them. We take a unified approach to the problem without compromising the solution time and provide techniques for optimal and heuristic solutions. We prove that the voltage assignment component of the problem itself is NP-hard and is inapproximable within any constant factor. Our optimal solution utilizes a Mixed Integer Linear Program (MILP) formulation of the problem. The heuristic utilizes MILP relaxation and randomized rounding. Experimental results based on E3S benchmark applications and a few real applications show that our heuristic produces near-optimal solution in a fraction of time needed to find the optimal.
UR - http://www.scopus.com/inward/record.url?scp=70349802415&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349802415&partnerID=8YFLogxK
U2 - 10.1109/NOCS.2009.5071448
DO - 10.1109/NOCS.2009.5071448
M3 - Conference contribution
AN - SCOPUS:70349802415
SN - 9781424441433
T3 - Proceedings - 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, NoCS 2009
SP - 80
EP - 85
BT - Proceedings - 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, NoCS 2009
T2 - 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip, NoCS 2009
Y2 - 10 May 2009 through 13 May 2009
ER -