An Energy-Efficient Task Scheduling Algorithm in DVFS-enabled Cloud Environment

The growth of energy consumption has been explosive in current data centers, super computers, and public cloud systems. This explosion has led to greater advocacy of green computing, and many efforts and works focus on the task scheduling in order to reduce energy dissipation. In order to obtain mor...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of grid computing Ročník 14; číslo 1; s. 55 - 74
Hlavní autori: Tang, Zhuo, Qi, Ling, Cheng, Zhenzhen, Li, Kenli, Khan, Samee U., Li, Keqin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Netherlands 01.03.2016
Predmet:
Algorithms
Cloud computing
Computer Science
Data centers
Energy management
Management of Computing and Information Systems
Processor Architectures
Processors
Task scheduling
Tasks
User Interfaces and Human Computer Interaction
Workflow
Cloud computing
Heterogeneous
Heuristic algorithm
Energy saving scheduling
DVFS
ISSN:1570-7873, 1572-9184
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The growth of energy consumption has been explosive in current data centers, super computers, and public cloud systems. This explosion has led to greater advocacy of green computing, and many efforts and works focus on the task scheduling in order to reduce energy dissipation. In order to obtain more energy reduction as well as maintain the quality of service by meeting the deadlines, this paper proposes a DVFS-enabled Energy-efficient Workflow Task Scheduling algorithm: DEWTS. Through merging the relatively inefficient processors by reclaiming the slack time, DEWTS can leverage the useful slack time recurrently after severs are merged. DEWTS firstly calculates the initial scheduling order of all tasks, and obtains the whole makespan and deadline based on Heterogeneous-Earliest-Finish-Time (HEFT) algorithm. Through resorting the processors with their running task number and energy utilization, the underutilized processors can be merged by closing the last node and redistributing the assigned tasks on it. Finally, in the task slacking phase, the tasks can be distributed in the idle slots under a lower voltage and frequency using DVFS technique, without violating the dependency constraints and increasing the slacked makespan. Based on the amount of randomly generated DAGs workflows, the experimental results show that DEWTS can reduce the total power consumption by up to 46.5 % for various parallel applications as well as balance the scheduling performance.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1570-7873
1572-9184
DOI:10.1007/s10723-015-9334-y