No abstract

No 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). 

No abstract

No abstract