Affiliation:
1. Carnegie Mellon University, Pittsburgh, PA, USA
2. N/A, Pittsburgh, PA, USA
Abstract
This paper investigates the performance of task assignment policies for server farms, as the variability of job sizes (service demands) approaches infinity. Our results reveal that some common wisdoms regarding task assignment are flawed. The Size-Interval-Task-Assignment policy (SITA), which assigns each server a unique size range, was heretofore thought of by some as the panacea for dealing with high-variability job-size distributions. We show SITA to be inferior to the much simpler greedy policy, Least-Work-Left (LWL), for certain common job-size distributions, including many modal, hyperexponential, and Pareto distributions. We also define regimes where SITA's performance is superior, and prove simple closed-form bounds on its performance for the above-mentioned distributions.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference30 articles.
1. Full paper (with appendix) available at http://www.cs.cmu.edu/~harchol/Papers/Sigmetrics09sita.pdf. Full paper (with appendix) available at http://www.cs.cmu.edu/~harchol/Papers/Sigmetrics09sita.pdf.
2. Generating representative Web workloads for network and server performance evaluation
3. Task assignment with work-conserving migration
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献