Dynamic Quantum Shift Algorithm for Load Balancing in High Performance Clusters

摘要

Load balancing aims at distributing load among different nodes within a cluster setup so as to prevent inefficient overloading of a single node. Many algorithms have been proposed for load balancing based on the introduction of some new parameters over the simple round robin algorithm to improve the overall performance of the system. A simple round robin and optimized round robin algorithm in load balancing gives high scalability and less response time. But unfortunately, there is low throughput, more waiting time and the performance is low. This paper proposes a new algorithm called dynamic quantum shift algorithm for load balancing which reduces the average waiting time and average turnaround time and improves efficiency over these two algorithms by setting the quantum time as minimum burst time of frequent processes.