Lag-based Load Balancing for Linux-based Multiprocessor Systems

Abstract

In this paper, we present a lag-based loadbalancing approach to achieve global fairness with the LinuxCFS (Completely Fair Scheduler). Lag of each task is definedas the ideal CPU time it should have received minus the actualCPU time it has received. The proposed approach monitorsthe lag of each task at runtime and moves tasks to underloadedprocessors so that each task can bound its lag. Weimplemented the proposed approach in the Linux kernel andexperimentally evaluated it. The results demonstrate that ouralgorithm shows significant fairness improvements.