Analysis of list scheduling algorithms for parallel system

Scheduling is more complex and important in the case of multiple processor environments. In this paper we have studied various multiple processor systems and their characteristics. Also, we have compared some heuristic scheduling algorithms namely LPT (Longest Processing Time), SPT (Shortest Processing Time), ECT (Earliest Completion Time) and EST (Earliest Starting Time) for n independent jobs on m identical machines in order to minimize the turnaround time and maximize the throughput. These jobs are arriving at random time. Here, we observe that throughput and turnaround time are not changing when the number of processors is more than the number of processes. We also observe that EST is best from the point of view of throughput and turnaround time, when number of processors is less than number of processes.