Research on scheduling algorithms in Web cluster servers

• DOI: 10.1007/bf02945458
• Publication Date: 2008-09-07T16:27:34Z
• Authors: YingChun Lei; Yili Gong; Song Zhang; GuoJie Li
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

This paper analyzes quantitatively the impact of the load balance scheduling algorithms and the locality scheduling algorithms on the performance of Web cluster servers, and brings forward the Adaptive_LARD algorithm. Compared with the representative LARD algorithm, the advantages of the Adaptive_LARD are that: (1) it adjusts load distribution among the back-ends through the idea of load balancing to avoid learning steps in the LARD algorithm and reinforce its adaptability; (2) by distinguishing between TCP connections accessing disks and those accessing cache memory, it can estimate the impact of different connections on the back-ends' load more precisely. Performance evaluations suggest that the proposed method outperforms the LARD algorithm by up to 14.7%.