To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.comnet.2005.08.005 Byline: Mingwei Gong, Carey Williamson Keywords: Web server performance; Scheduling; Fairness; Simulation; Performance analysis Abstract: This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Time (SRPT). We use a general-purpose probe-based sampling approach to estimate the mean and variance of the job response time for different job sizes, for arbitrary arrival processes and service time distributions. The results illustrate two different aspects of unfairness called endogenous unfairness and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown conditioned on job size, for a range of system loads. Our work confirms recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrates typical performance results for a practical range of job sizes in an empirical workload. Finally, we show the sensitivities of SRPT and PS scheduling to selected characteristics of the arrival process and job size distribution. Author Affiliation: Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada T2N 1N4 Article History: Received 25 January 2005; Revised 24 June 2005; Accepted 19 August 2005 Article Note: (miscellaneous) Responsible Editor: C.B. Westphall