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

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 67; číslo 2; s. 348 - 382
Hlavní autori:	Dinitz, Yefim, Dolev, Shlomi, Kumar, Manish
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2023
Predmet:	Computer Science Theory of Computation Self-stabilization Asynchronous system General graph Distributed algorithm Deterministic algorithm Load balancing Dynamic graph
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!