A Throughput-Driven Scheduling Algorithm of Differentiated Service for Web Cluster  

作　　者：YAN Cai-rong SHEN Jun-yi PENG Qin-ke WAN Yong-quan 

机构地区：[1]Software Institute, Xi＇ an Jiaotong University, Xi＇ an 710049, Shaanxi, China

出　　处：《Wuhan University Journal of Natural Sciences》2006年第1期88-92,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Funda-tion of China (60175015)

摘　　要：Requests distribution is an key technology for Web cluster server. This paper presents a throughput-driven scheduling algorithm （TDSA）. The algorithm adopts the throughput of cluster back-ends to evaluate their load and employs the neural network model to predict the future load so that the scheduling system features a self-learning capability and good adaptability to the change of load. Moreover, it separates static requests from dynamic requests to make full use of the CPU resources and takes the locality of requests into account to improve the cache hit ratio. Experimental re suits from the testing tool of WebBench^TM show better per formance for Web cluster server with TDSA than that with traditional scheduling algorithms.Requests distribution is an key technology for Web cluster server. This paper presents a throughput-driven scheduling algorithm （TDSA）. The algorithm adopts the throughput of cluster back-ends to evaluate their load and employs the neural network model to predict the future load so that the scheduling system features a self-learning capability and good adaptability to the change of load. Moreover, it separates static requests from dynamic requests to make full use of the CPU resources and takes the locality of requests into account to improve the cache hit ratio. Experimental re suits from the testing tool of WebBench^TM show better per formance for Web cluster server with TDSA than that with traditional scheduling algorithms.

关 键 词：Web cluster server throughput-driven scheduling algorithm differentiated service 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]