Task scheduling algorithm with duplication for distributed computing

There have been many scheduling algorithms proposed for scheduling tasks onto unlimited number of processors. In practical situations, there are only a limited number of processors available. Thus, the goal of this work is to propose a new feature to further improve the already-efficient Bounded-CPFD algorithm, [4]. Our approach is to, instead of having all processor available for scheduling as in the original bounded-CPFD algorithm, hold onto some processors until later during the scheduling process. This heuristic comes from an observation that overall scheduling at times benefits from having some unused processors at certain stages of scheduling. An extensive run of simulation shows significant performance improvement from the proposed techniques over the Bounded-CPFD.