TY - GEN
T1 - Brief Announcements
T2 - 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020
AU - Dinitz, Yefim
AU - Dolev, Shlomi
AU - Kumar, Manish
N1 - Funding Information: 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. Publisher Copyright: © 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - 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 ϵ-Balanced state for the continuous setting in time O(nDlog (nK/ ϵ) ) and 1-Balanced state for the discrete setting in time O(nDlog (nK/ D) + nD2), 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(nK2) for general graphs, and its self-stabilizing version.
AB - 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 ϵ-Balanced state for the continuous setting in time O(nDlog (nK/ ϵ) ) and 1-Balanced state for the discrete setting in time O(nDlog (nK/ D) + nD2), 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(nK2) for general graphs, and its self-stabilizing version.
KW - Deterministic
KW - Distributed algorithms
KW - Load balancing
KW - Monotonic
KW - Self-stabilization
UR - http://www.scopus.com/inward/record.url?scp=85097644947&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-030-64348-5_9
DO - https://doi.org/10.1007/978-3-030-64348-5_9
M3 - Conference contribution
SN - 9783030643478
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 113
EP - 117
BT - Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Proceedings
A2 - Devismes, Stéphane
A2 - Mittal, Neeraj
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 18 November 2020 through 21 November 2020
ER -