Suitability of Load Scheduling Algorithms to Workload Characteristics

In this paper, we investigate the suitability of load scheduling algorithms to workload characteristics. With a set of workloads classified by the amount of allocated resources and their allocation times, we perform experiments with various load scheduling algorithms. As adaptive scheduling algorithms, ARR and ALC are introduced on top of the ALBM (adaptive load balancing and management) cluster system. We present the performance results with a number of classified workloads and a realistic workload, explaining the performance relationship between workloads and scheduling algorithms.

[1]  Jeffrey S. Chase Server switching: yesterday and tomorrow , 2001, Proceedings. The Second IEEE Workshop on Internet Applications. WIAPP 2001.

[2]  Li Xiao,et al.  Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands , 2002, IEEE Trans. Parallel Distributed Syst..

[3]  Carey L. Williamson,et al.  Internet Web servers: workload characterization and performance implications , 1997, TNET.

[4]  Wensong Zhang,et al.  Linux Virtual Server for Scalable Network Services , 2000 .

[5]  Krishna Kant,et al.  Server Capacity Planning for Web Traffic Workload , 1999, IEEE Trans. Knowl. Data Eng..