Scheduling Algorithm for Distributing Static Request in Web Server Cluster
Web集群服务器中分发静态请求的调度算法*

This paper proposes an adaptive document-size-based scheduling algorithm for distributing static request called ADSB.It also proposes to use occupying resource time to measure load.The dispatcher of ADSB distributes static requests according to the request content size and tries to balance the load among real servers.ADSB periodically predicts the statistical characteristics of future workload based on workload history,and then adjusts system parameters according to the prediction.Because of its locality-aware nature,ADSB achieves very high cache hit ratio.For the sizes of realistic static Web documents follow heavy-tailed distribution,distributing "long" and "short" jobs to different real servers makes ADSB reduce the average job slowdown.Experiments show that ADSB,as compared with some existing classic scheduling algorithms,achieves superior performance.