Performance Analysis of Workload Dependent Load Balancing Policies
Authors:
Open Access
- 19 June 2019
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 3 (2) , 1-35
Abstract
Load balancing plays a crucial role in achieving low latency in large distributed systems. Recent load balancing strategies often rely on replication or use placeholders to further improve latency. However assessing the performance and stability of these strategies is challenging and is therefore often simulation based. In this paper we introduce a unified approach to analyze the performance and stability of a broad class of workload dependent load balancing strategies. This class includes many replication policies, such as replicate below threshold, delayed replication and replicate only small jobs, as well as strategies for fork-join systems. We consider systems with general job size distributions where jobs may experience server slowdown. We show that the equilibrium workload distribution of the cavity process satisfies a functional differential equation and conjecture that the cavity process captures the limiting behavior of the system as its size tends to infinity. We study this functional differential equation in more detail for a variety of load balancing policies and propose a numerical method to solve it. The numerical method relies on a fixed point iteration or a simple Euler iteration depending on the type of functional differential equation involved. We further show that additional simplifications can be made if certain distributions are assumed to be phase-type. Various numerical examples are included that validate the numerical method and illustrate its strength and flexibility.Keywords
Funding Information
- FWO (1103318N)
This publication has 16 references indexed in Scilit:
- Large-scale join-idle-queue system with general service timesJournal of Applied Probability, 2017
- A Better Model for Job Redundancy: Decoupling Server Slowdown and Job SizeIEEE/ACM Transactions on Networking, 2017
- Efficient Redundancy Techniques for Latency Reduction in Cloud SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2017
- When Do Redundant Requests Reduce Latency?IEEE Transactions on Communications, 2015
- Pull-based load distribution in large-scale heterogeneous service systemsQueueing Systems, 2015
- PH and MAP Fitting with Aggregated Traffic Traces2014
- Asymptotic independence of queues under randomized load balancingQueueing Systems, 2012
- Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web servicesPerformance Evaluation, 2011
- Randomized load balancing with general service time distributionsACM SIGMETRICS Performance Evaluation Review, 2010
- Efficient phase-type fitting with aggregated traffic tracesPerformance Evaluation, 2007