Cargando…

Dynamic Averaging Load Balancing on Cycles

We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step [Formula: see text] , a random edge is chosen, one unit of load is created, and placed at one of the endpoints. In the same step, assuming that loads are arbitrarily divisible, the two no...

Descripción completa

Detalles Bibliográficos
Autores principales: Alistarh, Dan, Nadiradze, Giorgi, Sabour, Amirmojtaba
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8927032/
https://www.ncbi.nlm.nih.gov/pubmed/35330618
http://dx.doi.org/10.1007/s00453-021-00905-9

Ejemplares similares