Energy-aware partitioning for multiprocessor real-time systems
Energy-aware partitioning for multiprocessor real-time systems
复制标题
DOI：
10.1109/ipdps.2003.1213225
复制
发表时间：
2003-04
期刊：
影响因子：
--
通讯作者：
Hakan Aydin;Qi Yang
中科院分区：
文献类型：
--
作者：
Hakan Aydin;Qi Yang
In this paper, we address the problem of partitioning periodic real-time tasks in a multiprocessor platform by considering both feasibility and energy-awareness perspectives: our objective is to compute the feasible partitioning that results in minimum energy consumption on multiple identical processors by using variable voltage earliest-deadline-first scheduling. We show that the problem is NP-hard in the strong sense on m /spl ges/ 2 processors even when feasibility is guaranteed a priori. Then, we develop our framework where load balancing plays a major role in producing energy-efficient partitionings. We evaluate the feasibility and energy-efficiency performances of partitioning heuristics experimentally.
