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
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
EQUILOAD: a load balancing policy for clustered web servers
Performance Evaluation
The M/G/c queue in light traffic
Queueing Systems: Theory and Applications
The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution
Queueing Systems: Theory and Applications
Designing a Call Center with Impatient Customers
Manufacturing & Service Operations Management
Heavy Traffic Limits for Queues with Many Deterministic Servers
Queueing Systems: Theory and Applications
Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue
Queueing Systems: Theory and Applications
Preventing Large Sojourn Times Using SMART Scheduling
Operations Research
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
Service Interruptions in Large-Scale Service Systems
Management Science
Performance Evaluation
The first Erlang century--and the next
Queueing Systems: Theory and Applications
Rare event simulation for a slotted time M/G/s model
Queueing Systems: Theory and Applications
Web Server Farm in the Cloud: Performance Evaluation and Dynamic Architecture
CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Valiant load balancing, capacity provisioning and resilient backbone design
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Why segregating short jobs from long jobs under high variability is not always a win
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Is Tail-Optimal Scheduling Possible?
Operations Research
| Hi-index | 0.00 |
We study the steady-state behavior of multiserver queues with general job size distributions under size interval task assignment SITA policies. Assuming Poisson arrivals and the existence of the αth moment of the job size distribution for some α 1, we show that if the job arrival rate and the number of servers increase to infinity with the traffic intensity held fixed, the SITA policy parameterized by α minimizes in a large deviation sense the steady-state probability that the total number of jobs in the system is greater than or equal to the number of servers. The optimal large deviation decay rate can be arbitrarily close to the one for the corresponding probability in an infinite-server queue, which only depends on the system traffic intensity but not on any higher moments of the job size distribution. This supports in a many-server asymptotic framework the common wisdom that separating large jobs from small jobs protects system performance against job size variability.