A Task Duplication Based Scheduling Algorithm for Avoiding Useless Duplication.
Koichi Asakura, Bing Shao, Toyohide Watanabe · Parallel and Distributed Processing Techniques and Applications · 2006
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.