Task Scheduling Algorithm using Constrained Duplication in Homogeneous Systems

초록

Duplication based heuristics are more effective than list and cluster based heuristics. However, most of the duplication based scheduling algorithms induce redundant duplications at join nodes. Redundant duplications cause the scheduling length to increase under a bounded number of processors. In this paper, we propose a novel algorithm that allocates the join node without the redundant duplication. Performance, in terms of normalized schedule length, is compared with some of the well-known and recently proposed algorithms. The suggested algorithm turns out to be most useful on a bounded number of processors by Gantt chart and simulation on an arbitrary random graph.