Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs

We study the classic load balancing problem on dynamic general graphs, where the graph changes arbitrarily between the computational rounds, remaining connected with no permanent cut. A lower bound of Ω( n 2 ) for the running time bound in the dynamic setting, where n is the number of nodes in the g...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 67; no. 2; pp. 348 - 382
Main Authors:	Dinitz, Yefim, Dolev, Shlomi, Kumar, Manish
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2023
Subjects:	Computer Science Theory of Computation Self-stabilization Asynchronous system General graph Distributed algorithm Deterministic algorithm Load balancing Dynamic graph
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!