A new scheduling algorithm for server farms load balancing

TL;DR

This paper introduces a new non-preemptive scheduling algorithm for server farms that reduces response time and overcomes starvation issues associated with SRPT, improving load balancing efficiency.

Contribution

The paper presents a novel scheduling algorithm tailored for server farm load balancing that addresses starvation and optimizes response time.

Findings

Reduced mean turnaround time in server farm experiments

Overcomes starvation issues of SRPT scheduling

Effective in process scheduling for operating systems

Abstract

This paper describes a new scheduling algorithm to distribute jobs in server farm systems. The proposed algorithm overcomes the starvation caused by SRPT (Shortest Remaining Processing Time). This algorithm is used in process scheduling in operating system approach. The algorithm was developed to be used in dispatcher scheduling. This algorithm is non-preemptive discipline, similar to SRPT, in which the priority of each job depends on its estimated run time, and also the amount of time it has spent on waiting. Tasks in the servers are served in order of priority to optimize the system response time. The experiments show that the mean round around time is reduced in the server farm system.