Motivated by the desire to shift workload during periods of overload, we extend established square-root capacity sizing rules for many-server systems in the Quality-and-Efficiency Driven (QED) regime. We propose Delayed Workload Shifting (DWS) which has two defining features: when there are n users in the system, newly arriving users are no longer admitted directly. Instead, these users will reattempt getting access after a stochastic delay until they are successful. The goal of DWS is to release pressure from the system during overloaded periods, and indeed we show that the performance gain can be substantial. We derive nontrivial corrections to classical QED approximations to account for DWS, and leverage these to control stationary and t...
We design a dynamic algorithm for dimensioning and stabilizing a cloud provisioning process. We mode...
In this paper, we establish a many-sources large deviations principle (LDP) for the stationary work...
textabstractSize-based scheduling strategies such as Shortest Remaining Processing Time first (SRPT)...
Motivated by the desire to shift workload during periods of overload, we extend established square-r...
Multiserver queueing systems describe situations in which users require service from multiple parall...
Multiserver queueing systems describe situations in which users require service from multiple parall...
\u3cp\u3eMultiserver queueing systems describe situations in which users require service from multip...
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guarante...
A well-known problem when executing data-intensive workloads with such frameworks as MapReduce is th...
We consider a distributed server system and ask which policy should be used for assigning tasks to h...
We consider a distributed server system and ask which policy should be used for assigning jobs (task...
In many-server systems it is crucial to staff the right number of servers so that targeted service l...
International audienceCurrent architecture of many computer systems relies on dynamic allocation of ...
We design a dynamic algorithm for dimensioning and stabilizing a cloud provisioning process. We mode...
In this paper, we establish a many-sources large deviations principle (LDP) for the stationary work...
textabstractSize-based scheduling strategies such as Shortest Remaining Processing Time first (SRPT)...
Motivated by the desire to shift workload during periods of overload, we extend established square-r...
Multiserver queueing systems describe situations in which users require service from multiple parall...
Multiserver queueing systems describe situations in which users require service from multiple parall...
\u3cp\u3eMultiserver queueing systems describe situations in which users require service from multip...
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guarante...
A well-known problem when executing data-intensive workloads with such frameworks as MapReduce is th...
We consider a distributed server system and ask which policy should be used for assigning tasks to h...
We consider a distributed server system and ask which policy should be used for assigning jobs (task...
In many-server systems it is crucial to staff the right number of servers so that targeted service l...
International audienceCurrent architecture of many computer systems relies on dynamic allocation of ...
We design a dynamic algorithm for dimensioning and stabilizing a cloud provisioning process. We mode...
In this paper, we establish a many-sources large deviations principle (LDP) for the stationary work...
textabstractSize-based scheduling strategies such as Shortest Remaining Processing Time first (SRPT)...