Analysis of Process Scheduling Algorithm for Multiprocessor System

The scheduling of tasks in heterogeneous and homogeneous multiprocessor environment has been a topic of interest for the scholars and researcher for a long time. List task scheduling helps to develop various scientific appliances. It is NP- complete problem finding an optimal solution; hence it pairs low complexity with better results. The goal of scheduling task is the minimization of the total computation time. For multiple processor environments, list task scheduling is depicted using Directed Acyclic Graph (DAG) and described in both dynamic and static scheduling algorithms. In this literature review, we have discussed various algorithms to schedule the tasks which are a kind of static task scheduling algorithm for both homogeneous multiprocessor scheduling and heterogeneous multiprocessor scheduling environment. The comparative study of scheduling algorithm is based on the performance matrices termed as efficiency, Scheduling length, load balancing, and Speedup.