4.6 Article

Greening Duplication-Based Dependent-Tasks Scheduling on Heterogeneous Large-Scale Computing Platforms

Journal

JOURNAL OF GRID COMPUTING
Volume 19, Issue 1, Pages -

Publisher

SPRINGER
DOI: 10.1007/s10723-021-09554-2

Keywords

Energy-aware scheduling; Heuristics-based scheduling; Duplication-based scheduling; Heterogeneous large-scale computing platforms; Green computing

Ask authors/readers for more resources

Low-cost and high-performance execution of computing-intensive applications rely on large-scale heterogeneous computing platforms, but this raises the issue of electrical energy consumption. The Green mechanism proposed in this paper aims to reduce energy consumption caused by task duplication and has been shown to significantly reduce energy consumption in various duplication-based list-scheduling algorithms.
Low-cost and high-performance execution of nowadays computing-intensive applications will not be possible without large-scale heterogeneous computing platforms. The huge computing power of such platforms raises the problem of the electrical energy consumed by such platforms. One of the key issues to achieve high-performance in such platforms is task-scheduling. Among the heuristics-based compile-time dependent-task scheduling heuristics, duplication-based list scheduling heuristics give the earliest finish time of the application tasks. Unfortunately, due to the additional computing cost required by duplication, these heuristics consume more computing power that leads to more electrical energy consumption. Energy-efficiency and green-computing turn the attention to the need for new generations of energy-aware task-scheduling algorithms. This paper presents a duplication reduction mechanism that can be applied to any schedule produced by a duplication-based scheduling algorithm. The aims of the proposed mechanism are to keep the same finish time of the scheduled application tasks, to keep the lower-bound time-complexity of the heuristics-based dependent task scheduling algorithms, and to significantly reduce the energy consumed by task-duplication. The mechanism is called Green. Green was applied to four of the most-recent and well-known duplication-based list-scheduling algorithms. The experimental results based on computer simulation utilizing C# language for large sets of both randomly generated and three real-world applications graphs show that Green can significantly reduce the energy consumed by each algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available