9 2 this paper presents a task duplication based scheduling tds algorithm which can schedule directed acyclic graphs dags with a complexity of o v 2 where v is the number of tasks in the dag