Dynamic load balancing for cloud systems under heterogeneous setup delays
By: Fernando Paganini, Diego Goldsztajn
Potential Business Impact:
Makes computer jobs finish faster, without waiting.
We consider a distributed cloud service deployed at a set of distinct server pools. Arriving jobs are classified into heterogeneous types, in accordance with their setup times which are differentiated at each of the pools. A dispatcher for each job type controls the balance of load between pools, based on decentralized feedback. The system of rates and queues is modeled by a fluid differential equation system, and analyzed via convex optimization. A first, myopic policy is proposed, based on task delay-to-service. Under a simplified dynamic fluid queue model, we prove global convergence to an equilibrium point which minimizes the mean setup time; however queueing delays are incurred with this method. A second proposal is then developed based on proximal optimization, which explicitly models the setup queue and is proved to reach an optimal equilibrium, devoid of queueing delay. Results are demonstrated through a simulation example.
Similar Papers
Stability and Heavy-traffic Delay Optimality of General Load Balancing Policies in Heterogeneous Service Systems
Performance
Makes jobs go to the right computer faster.
Size-Aware Dispatching to Fluid Queues
Performance
Guides jobs to servers to make waiting shorter.
A Dynamic Service Offloading Algorithm Based on Lyapunov Optimization in Edge Computing
Networking and Internet Architecture
Makes phones work better by sharing tasks.