Review of Task Duplication Based (TDB) Scheduling Algorithms

Task scheduling is a well-known NP-complete problem. It is one of the research areas in parallel computing. Task scheduling consists of an application program and a set of processors for allocating the various tasks. An application program is represented using a directed acyclic graph(DAG) and a set of processors that are homogenous and fully connected. In this paper, we study different task duplication-based (TDB) scheduling algorithms and their priority attributes and time complexity. Also, we will discuss different types of performance metrics in task scheduling algorithms. These performance metrics help to analyze different task scheduling algorithms.