Improved bounds for distributed load balancing
From MaRDI portal
Publication:6534998
DOI10.4230/lipics.disc.2020.1zbMATH Open1543.68443MaRDI QIDQ6534998
Aaron Bernstein, Sepehr Assadi, Zachary Langley
Publication date: 2 November 2023
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Distributed algorithms (68W15)
Cites Work
- The price of anarchy for polynomial social cost
- Selfish load balancing and atomic congestion games
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Distributed backup placement in networks
- A data structure for dynamic trees
- Self-stabilizing local \(k\)-placement of replicas with local minimum variance
- A survey of game-theoretic approaches in wireless sensor networks
- Faster Algorithms for Semi-Matching Problems
- Improved Distributed Approximate Matching
- Simultaneously load balancing for every p-norm, with reassignments
- Scheduling independent tasks to reduce mean finishing time
- All-norm approximation algorithms
- Distributed 2-Approximation Algorithm for the Semi-matching Problem
- Approximating Semi-matchings in Streaming and in Two-Party Communication
- Approximation algorithms for minimum norm and ordered optimization problems
- Online Bipartite Matching with Amortized O (log 2 n ) Replacements
- Maintaining Assignments Online: Matching, Scheduling, and Flows
- Semi-matchings for bipartite graphs and load balancing
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Distributed backup placement in one round and its applications to maximum matching approximation and self-stabilization
Related Items (1)
This page was built for publication: Improved bounds for distributed load balancing
