Comparative Study on Load Distribution of Heuristic Scheduling Algorithm

For complex computation sequential processing does not work better due to reasonable amount of time. Therefore, the parallel processing is become more suitable for complex computation or large problem. In parallel processing multiple processing unit works together to complete the task. Hence the processing load is distributed among all the available processing units. This is done by scheduling still it is not so easy to distribute the overall load equally to all available processor due to some anomaly or hazard like instruction or data dependency etc. Therefore redistribution takes place for fair distribution of load. This paper investigates the load balancing of some heuristic scheduling algorithms. Investigation shows that as the numbers of processor increase the load balance become more difficult.