Improved Approach in Load Balancing For Parallel Computing

In almost every aspect of today’s world, parallel computing is playing as is a very noteworthy role in meeting the rising needs of the digital world. The purpose of this paper is to show that if we combine the logic of Weighted Round Robin algorithm with Minimum Completion Time algorithm, then newly developed hybrid algorithm provides us optimal results like shorter makes pan, lowest execution time, lowest energy consumption, lowest latency, highest throughput in comparison to Round Robin (RR), Opportunistic Load Balancing (OLB), Minimum Execution Time (MET) and Minimum Completion Time Algorithm. Thus, hybrid algorithm is more reliable to schedule the gives tasks or jobs to nodes of computing system as well as it can also remove the load imbalance problem to greater extent. With these optimal results, we can say that hybrid scheduling and load balancing can finish the workload within given deadline.