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

Asymptotically optimal parallel resource assignment with interference

Autor: Rudesindo Núñez-Queija, Ina Maria Verloop

Publikováno v: Queueing Systems, 65(1), 43-92. Springer Netherlands
Queueing Systems
Queueing Systems, Springer Verlag, 2010, 65 (1), pp.43-92. ⟨10.1007/s11134-010-9171-4⟩
BIRD: BCAM's Institutional Repository Data
instname

Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous service requirement distributions. The aggregate service capacity is assumed

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81a0d5ee08763bf61054f79da1c95fbe
https://doi.org/10.1007/s11134-010-9171-4

Asymptotically optimal parallel resource assignment with interference

Autor: Verloop, M., Núñez-Queija, R.

Motivated by scheduling in multi-cell wireless networks and resource allocation in computer systems, we study a service facility with two types of users (or jobs) having heterogeneous size distributions. Our model may be viewed as a parallel two-serv

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::b1f1b64902c3ec2fed2d52d77cb7f80b
https://dare.uva.nl/personal/pure/en/publications/asymptotically-optimal-parallel-resource-assignment-with-interference(a2b32826-8491-444c-aa85-5061f4357968).html

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.