Task scheduling in multiprocessing systems using duplication

Task scheduling continues to be one of the most challenging problems in both parallel and distributed computing environments. In this paper, we present a task scheduling algorithm, which uses duplication, to optimally schedule any application represented in the form of a directed acyclic graph (DAG). It has a time complexity of O(d|V|3)O(d|V|3), where ∣V∣ represents the number of tasks and d the maximum indegree of tasks.