Self-stabilizing repeated balls-into-bins

Autor: Emanuele Natale, Gustavo Posta, Francesco Pasquale, Andrea E. F. Clementi, Luca Becchetti

Publikováno v: Distributed Computing
Distributed Computing, Springer Verlag, 2019, 32 (1), pp.59-68. ⟨10.1007/s00446-017-0320-4⟩
Distributed Computing, 2019, 32 (1), pp.59-68. ⟨10.1007/s00446-017-0320-4⟩
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA '15)
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA '15), Jun 2015, Portland, United States. pp.332-339, ⟨10.1145/2755573.2755584⟩
SPAA

We study the following synchronous process that we call repeated balls-into-bins. The process is started by assigning n balls to n bins in an arbitrary way. Then, in every subsequent round, one ball is chosen according to some fixed strategy (random,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82973e04433da734f5a99374cca53710
https://hal.archives-ouvertes.fr/hal-02948569

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.