Design of Forecasting Least Connections First Scheduling Algorithm in Clustered Web Servers
Wu Song · 2002
A few request dispatching algorithms are discussed. To the problem of that these request dispatching algorithms are based on current status of queue, a new scheduling algorithm is proposed which is called forecasting least connections first scheduling algorithm. It forecasts the future status of queue by velocity of request,load of servers and historical information of queue, then dispatch request according to the future status of queue. It can effectively solve the load imbalance problem among the servers.