Classification of List Task Scheduling Algorithms: A Short Review Paper
Nidhi Rajak1, Anurag Dixit1, and Ranjit Rajak2
1.School of Computing Science & Engineering, Galgotias University, Greater Noida, India
2.Department of Computer Science & Applications, Dr. Hari Singh Gour Central University(MP), Sagar, India
2.Department of Computer Science & Applications, Dr. Hari Singh Gour Central University(MP), Sagar, India
Abstract—Task scheduling algorithms are also known as multiprocessor scheduling algorithms. These are mainly used in scientific and engineering applications. It is also considered as a NP-complete problem. The primary objective of list task scheduling algorithms is to minimize the overall execution time. Task scheduling in multiprocessor environment is represented by directed acyclic graph (DAG). It is classified into static and dynamic task scheduling. List task scheduling algorithms is a type of static task scheduling algorithm. In this paper, we have studied different list of task scheduling algorithms: HLFET, ISH, MCP, ETF, DLS and CNPT algorithms. A comparative study amongst the list task scheduling can be based on the following matrices: scheduling length, speedup, efficiency, load balancing, and normalized scheduling length(NSL).
Index Terms—parallel processing, Directed Acyclic Graph(DAG), scheduling length, speedup, efficiency
Cite: Nidhi Rajak, Anurag Dixit, and Ranjit Rajak, "Classification of List Task Scheduling Algorithms: A Short Review Paper," Journal of Industrial and Intelligent Information, Vol. 2, No. 4, pp. 320-323, December 2014. doi: 10.12720/jiii.2.4.320-323
Index Terms—parallel processing, Directed Acyclic Graph(DAG), scheduling length, speedup, efficiency
Cite: Nidhi Rajak, Anurag Dixit, and Ranjit Rajak, "Classification of List Task Scheduling Algorithms: A Short Review Paper," Journal of Industrial and Intelligent Information, Vol. 2, No. 4, pp. 320-323, December 2014. doi: 10.12720/jiii.2.4.320-323