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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 67; H. 2; S. 348 - 382
Hauptverfasser:	Dinitz, Yefim, Dolev, Shlomi, Kumar, Manish
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!