A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems

Authors:
Tarek Hagras;Jan Janecek
Affiliations:
Czech Technical University in Prague;Czech Technical University in Prague
Venue:
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Year:
2004

Citing 0
Cited 7

Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Performance effective pre-scheduling strategy for heterogeneous grid systems in the master slave paradigm

Future Generation Computer Systems
A dominant predecessor duplication scheduling algorithm for heterogeneous systems

The Journal of Supercomputing
Earliest starting and finishing time duplication-based algorithm

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
A task duplication based bottom-up scheduling algorithm for heterogeneous environments

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A critical predecessor duplication scheduling algorithm for distributed heterogeneous computing environments

TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
An effective duplication-based task-scheduling algorithm for heterogeneous systems

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Task scheduling is in general an NP-complete problem. For this reason a huge number of heuristics have been presented in the literature to obtain near optimal schedules. These heuristics mainly target homogeneous computing systems, while a few of them target heterogeneous systems. The heterogeneous heuristics presented so far target computing machines with different capabilities, while almost none of them handle heterogeneous communication systems. This paper presents a novel task scheduling algorithm called the Heterogeneous Critical Tasks Reverse Duplicator (HCTRD), which targets both heterogeneous computation and communication systems. The algorithm is based on list-scheduling and task-duplication in a bounded number of machines, and aims to achieve high performance and near lower bound complexity.