Exploiting process lifetime distributions for dynamic load balancing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Task assignment with unknown duration
Journal of the ACM (JACM)
EQUILOAD: a load balancing policy for clustered web servers
Performance Evaluation
Cycle stealing under immediate dispatch task assignment
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Task Assignment Strategy for Overloaded Systems
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Analysis of Task Assignment with Cycle Stealing under Central Queue
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A least flow-time first load sharing approach for distributed server farm
Journal of Parallel and Distributed Computing
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
Task assignment with work-conserving migration
Parallel Computing
Allocation of Service Time in a Multiserver System
Management Science
Comparing job allocation schemes where service demand is unknown
Journal of Computer and System Sciences
Analysis of size interval task assignment policies
ACM SIGMETRICS Performance Evaluation Review
Surprising results on task assignment in server farms with high-variability workloads
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Review: Task assignment policies in distributed server systems: A survey
Journal of Network and Computer Applications
Mathematics of Operations Research
Hi-index | 0.01 |
This paper investigates the performance of task assignment policies for server farms as the variability of job sizes (service demands) approaches infinity. The Size-Interval-Task-Assignment policy (SITA), which separates short jobs from long jobs, has long been viewed as the panacea for dealing with high-variability job-size distributions. A very recent paper [16] showed that this common wisdom is flawed: SITA can actually 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. The above finding leads one to question whether providing isolation for short jobs from long ones is inherently bad, or whether it is just SITA's strict isolation of short jobs that sometimes leads to poor performance. To answer this question, we consider a much more flexible policy, which we call "Cycle-Stealing" (CS). The CS policy is very similar to LWL, in that short jobs can go to any queue, but it still provides short jobs isolation from longs (one server is reserved for short jobs). While CS has many of the same properties as LWL, including high utilization of both servers, we prove, surprisingly, that, for high variability job sizes, CS performs poorly whenever SITA performs poorly. This result suggests that the notion of isolating short jobs from long jobs, under high variability workloads, is sometimes simply not the right thing to do.