Local deal-agreement algorithms for load balancing in dynamic general graphs

DOI10.1007/s00224-022-10097-6MaRDI QIDQ6038713

No author found.

Publication date: 2 May 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

load balancingdistributed algorithmself-stabilizationdeterministic algorithmasynchronous systemdynamic graphgeneral graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computer system organization (68Mxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic load balancing with group communication
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Locally optimal load balancing
• Constant-space self-stabilizing token distribution in trees
• Locality in Distributed Graph Algorithms
• Distributed Computing: A Locality-Sensitive Approach
• Improved Analysis of Deterministic Load-Balancing Schemes
• Near-perfect load balancing by randomized rounding
• Discrete load balancing is (almost) as easy as continuous load balancing
• Approximate load balancing on dynamic and asynchronous networks
• Distributing Unit Size Workload Packages in Heterogeneous Networks
• A simple approach for adapting continuous load balancing processes to discrete settings
• Smoothed analysis of dynamic networks

This page was built for publication: Local deal-agreement algorithms for load balancing in dynamic general graphs