Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System

Authors:
E. Ilavarasan;P. Thambidurai;R. Mahilmannan
Affiliations:
Pondicherry Engineering College, India;Pondicherry Engineering College, India;Pondicherry Engineering College, India
Venue:
ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
Year:
2005

Citing 0
Cited 8

Research Note: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
The anatomy study of high performance task scheduling algorithm for Grid computing system

Computer Standards & Interfaces
A minimized makespan scheduler with multiple factors for Grid computing systems

Expert Systems with Applications: An International Journal
A generalized critical task anticipation technique for DAG scheduling

ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks

Journal of Parallel and Distributed Computing
Adaptable scheduling algorithm for grids with resource redeployment capability

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous multi-core system

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids

International Journal of Grid and High Performance Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Finding an optimal solution to the problem of scheduling an application modeled by a Directed Acyclic Graph (DAG) onto a distributed system is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous computing system, where the processors in the network may not be identical and take different amounts of time to execute the same task. This paper introduces a Performance Effective Task Scheduling (PETS) Algorithm for Network of Heterogeneous system, with complexity O (v+e) (p+ log v), which provides optimal results for applications represented by DAGs. The performance of the algorithm is illustrated by comparing the schedule length, speedup, efficiency and the scheduling time with existing algorithms such as, Heterogeneous Earliest Finish Time (HEFT) and Critical-Path On a processor (CPOP) and Levelized Min Time (LMT) reported in this paper. The comparison study based on both randomly generated graphs and graphs of some real applications shows that PETS algorithm substantially outperforms existing algorithms.