返回
An energy-efficient process clustering assignment algorithm for distributed system
DOI:10.1016/j.simpat.2013.09.005.png)
摘要
En 中文
This paper proposes a distributed assignment algorithm for selecting the optimal energy consumption during process execution, idling, and transmission in a distributed system. Selection criteria are based on identifying candidate processing units that are suitable for minimizing idle energy in task scheduling. The proposed algorithm tries to mimic as close to real situation as possible by assuming that each processing unit has multiple capabilities to execute different tasks with different characteristics. Task scheduling can be flexibly carried out to attain optimal energy consumption without any restrictions as those of comparative algorithms. Thus, the energy required by each processing unit varies considerably depending on the schedule. Experimental results show that the proposed algorithm yields the lowest idle, total energy consumption, and satisfactory execution energy. The extraneous transmission energy is a trade-off for scheduling flexibility. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Distributed assignment algorithm
Dependent task graph
Processing unit
Task scheduling
Energy aware
期刊
IF:
4.6
论文数:
2.6K
被引数:
4.8K
机构
引用论文
Investigation of the optical properties of the Cr doped CuxO thin film deposited by thermionic vacuum arc plasma
Optik
IF0
A non-traditional approach to cryopreservation by ultra-rapid cooling for human mesenchymal stem cells
PLOS ONE
IF0
Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度

