Abstract
In computer networks, participants may cooperate in processing tasks, balancing working loads among them. The distributed load balancing problem is well-known. We present local algorithms solving it based on a short deal-agreement communication. Unlike the previous algorithms, they converge monotonically, always providing a better feasible state as the execution progresses. Our synchronous algorithms achieve \(\epsilon \)-Balanced state for the continuous setting in time \(O(n D \log (n K/\epsilon ))\) and 1-Balanced state for the discrete setting in time \(O(n D \log (n K/D) + n D^2)\), for general graphs in the worst case, where n is the number of nodes, K is the initial discrepancy, and D is the graph diameter. We also suggest an asynchronous load balancing algorithm solving the problem in time \(O(n K^2)\) for general graphs, and its self-stabilizing version.
This research was (partially) funded by the Office of the Israel Innovation Authority of the Israel Ministry of Economy under Genesis generic research project, the Rita Altura trust chair in computer science, and by the Lynne and William Frankel Center for Computer Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aiello, W., Awerbuch, B., Maggs, B.M., Rao, S.: Approximate load balancing on dynamic and asynchronous networks. In: 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 632–641 (1993)
Aspnes, J., Herlihy, M., Shavit, N.: Counting networks and multi-processor coordination. In: 23rd Annual ACM Symposium on Theory of Computing (STOC), pp. 348–358 (1991)
Boillat, J.E.: Load balancing and Poisson equation in a graph. Concurrency Pract. Experience 2(4), 289–314 (1990)
Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7(2), 279–301 (1989)
Dean, T.L., Boddy, M.S.: An analysis of time-dependent planning. In: 7th National Conference on Artificial Intelligence, pp. 49–54 (1988)
Dinitz, Y., Dolev, S., Kumar, M.: Local deal-agreement based monotonic distributed algorithms for load balancing in general graphs. CoRR abs/2010.02486 (2020)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chic. J. Theor. Comput. Sci. 1997, 3.1–3.15 (1997)
Horvitz, E.: Reasoning about beliefs and actions under computational resource constraints. Int. J. Approx. Reason. 2(3), 337–338 (1988)
Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and the analysis of iterative load balancing schemes. In: 39th Annual Symposium on Foundations of Computer Science, (FOCS), pp. 694–705 (1998)
Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. In: 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 341–350 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Dinitz, Y., Dolev, S., Kumar, M. (2020). Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs. In: Devismes, S., Mittal, N. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2020. Lecture Notes in Computer Science(), vol 12514. Springer, Cham. https://doi.org/10.1007/978-3-030-64348-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-64348-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64347-8
Online ISBN: 978-3-030-64348-5
eBook Packages: Computer ScienceComputer Science (R0)