Abstract: "We evaluate the performance of threshold-based job allocation policies in a heterogeneous distributed computing system, where servers may have different speeds, and jobs may have different service demands, importance, and/or affinities for different servers. We find that while threshold-based policies typically yield low mean response time, these policies are not robust with respect to fluctuations or misprediction of the load. We propose a new adaptive dual-threshold policy and show that this policy yields low mean response time while also being robust.
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming j...
The paper studies a controllable multi-server heterogeneous queueing system where servers operate at...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
Heterogeneous machines can be significantly better than homogeneous machines but for that an effecti...
In this thesis we consider a system of two heterogeneous servers with a shared queue, and examine a ...
We consider a large-scale service system where incoming tasks have to be instantaneously dispatched ...
We extend the validity of some results on the optimal control of two-server queueing models with ser...
At present, solutions of many practical problems require significant computational resources and sys...
We provide the first analytical study of the mean response time and robustness of a wide range of t...
We examine threshold-based transmission strategies for distributed opportunistic medium access, and ...
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
We analyze randomized dynamic load balancing schemes for multi-server processor sharing sys-tems whe...
In this paper we present three scalable, fully distributed, threshold-based algorithms for allocatin...
A model comprising several servers, each equipped with its own queue and with possibly different ser...
A model comprising several servers, each equipped with its own queue and with possibly different ser...
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming j...
The paper studies a controllable multi-server heterogeneous queueing system where servers operate at...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
Heterogeneous machines can be significantly better than homogeneous machines but for that an effecti...
In this thesis we consider a system of two heterogeneous servers with a shared queue, and examine a ...
We consider a large-scale service system where incoming tasks have to be instantaneously dispatched ...
We extend the validity of some results on the optimal control of two-server queueing models with ser...
At present, solutions of many practical problems require significant computational resources and sys...
We provide the first analytical study of the mean response time and robustness of a wide range of t...
We examine threshold-based transmission strategies for distributed opportunistic medium access, and ...
We consider a heterogeneous two-server system processing fixed size jobs. This includes the scheduli...
We analyze randomized dynamic load balancing schemes for multi-server processor sharing sys-tems whe...
In this paper we present three scalable, fully distributed, threshold-based algorithms for allocatin...
A model comprising several servers, each equipped with its own queue and with possibly different ser...
A model comprising several servers, each equipped with its own queue and with possibly different ser...
We consider a parallel server queueing system consisting of a bank of buffers for holding incoming j...
The paper studies a controllable multi-server heterogeneous queueing system where servers operate at...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...