A Task Duplication Based Scheduling Algorithm for Avoiding Useless Duplication

In this paper, we propose a task duplication based scheduling algorithm for avoiding useless duplication. In our algorithm, task duplication is divided into two phases: a task fill phase and a task duplication phase. In the task fill phase, tasks are duplicated and allocated to idle time slots in used processors. Namely, the task fill phase does not require additional idle processors. The task duplication phase is invoked only if there are idle processors to be left for a new allocation. Thus, our algorithm can consume computing facilities effectively. Experimental results show that our algorithm can achieve less computation time and less use of idle processors.

[1]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Hironori Kasahara,et al.  Performance Evaluation of Minimum Execution Time Multiprocessor Scheduling Algorithms Using Standard Task Graph Set , 2000, PDPTA.

[3]  Dharma P. Agrawal,et al.  Optimal Scheduling Algorithm for Distributed-Memory Machines , 1998, IEEE Trans. Parallel Distributed Syst..

[4]  Dharma P. Agrawal,et al.  A task duplication based scheduling algorithm for heterogeneous systems , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[5]  D. P. Agrawal,et al.  SDBS: a task duplication based optimal scheduling algorithm , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[6]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

[7]  Dharma P. Agrawal,et al.  A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems , 1997, J. Parallel Distributed Comput..