Skip to Main Content
This paper address the problem of static task clustering and scheduling of a parallel program given as a Directed Acyclic Graph(DAG) with duplication. Scheduling of task graphs onto multiprocessors is known to be an NP-complete in most cases leading to solutions based on heuristics. In this paper, a novel task-duplication scheduling heuristic is presented. Our approach differs from other heuristics found in literature since task clustering and scheduling are handled during the same phase. This technique omit the need of the independent clustering and scheduling phases (i.e., creating a cluster for every single task in the given DAG followed by the scheduling process) as in. Preliminarily results shows that our algorithm outperforms PY, LWB, PLW, TCSD and LG algorithms in terms of the overall makespan, and total number of processors used.