Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing - Heterogeneous computing
Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System
ISPDC '05 Proceedings of the The 4th International Symposium on Parallel and Distributed Computing
Critical-Task anticipation scheduling algorithm for heterogeneous and grid computing
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Hi-index | 0.00 |
The problem of scheduling a weighted directed acyclic graph (DAG) representing an application to a set of heterogeneous processors to minimize the completion time has been recently studied. The NP-completeness of the problem has instigated researchers to propose different heuristic algorithms. In this paper, we present a Generalized Critical-task Anticipation (GCA) algorithm for DAG scheduling in heterogeneous computing environment. The GCA scheduling algorithm employs task prioritizing technique based on CA algorithm and introduces a new processor selection scheme by considering heterogeneous communication costs among processors for adapting grid and scalable computing. To evaluate the performance of the proposed technique, we have developed a simulator that contains a parametric graph generator for generating weighted directed acyclic graphs with various characteristics. We have implemented the GCA algorithm along with the CA and HEFT scheduling algorithms on the simulator. The GCA algorithm is shown to be effective in terms of speedup and low scheduling costs.