Performance Evaluation of Request Scheduling Techniques in the Linux Cluster Web Server


The KIPS Transactions:PartA, Vol. 10, No. 4, pp. 285-294, Oct. 2003
10.3745/KIPSTA.2003.10.4.285,   PDF Download:

Abstract

The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity. The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. G. Han, L. J. U, L. J. Won, K. S. Dong, C. J. Seog, "Performance Evaluation of Request Scheduling Techniques in the Linux Cluster Web Server," The KIPS Transactions:PartA, vol. 10, no. 4, pp. 285-294, 2003. DOI: 10.3745/KIPSTA.2003.10.4.285.

[ACM Style]
Lee Gyu Han, Lee Jong U, Lee Jae Won, Kim Seong Dong, and Chae Jin Seog. 2003. Performance Evaluation of Request Scheduling Techniques in the Linux Cluster Web Server. The KIPS Transactions:PartA, 10, 4, (2003), 285-294. DOI: 10.3745/KIPSTA.2003.10.4.285.