Distributed load balancing: a new framework and improved guarantees

DOI10.4230/LIPICS.ITCS.2021.79MaRDI QIDQ7229368zbMATH OpenFDO

Authors Sara Ahmadian, Allen Liu, Binghui Peng, Morteza Zadimoghaddam

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.79

zbMATH Keywords

distributed algorithmsload balancing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A parallel approximation algorithm for positive linear programming
• Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time
• Automata, Languages and Programming
• Distributed 2-approximation algorithm for the semi-matching problem
• Distributed backup placement in networks
• Local divergence of Markov chains and the analysis of iterative load-balancing schemes
• Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
• Stateless distributed gradient descent for positive linear programs
• Unified acceleration method for packing and covering problems via diameter reduction
• Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel

This page was built for publication: Distributed load balancing: a new framework and improved guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229368)