On weighted balls-into-bins games

被引：36

作者：

Berenbrink, Petra ^{[1
]}

Friedetzky, Tom ^{[2
]}

Hu, Zengjian ^{[1
]}

Martin, Russell ^{[3
]}

机构：

[1] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada

[2] Univ Durham, Dept Comp Sci, Durham DH1 3LE, England

[3] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England

来源：

THEORETICAL COMPUTER SCIENCE | 2008年 / 409卷 / 03期

关键词：

Balls-into-bins games; Random resource allocation; Weighted balls;

D O I：

10.1016/j.tcs.2008.09.023

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the well-known problem of randomly allocating m balls into n bins. We investigate various properties of single-choice games as well as multiple-choice games in the context of weighted balls. We are particularly interested in questions that are concerned with the distribution of ball weights, and the order in which balls are allocated. Do any of these parameters influence the maximum expected load of any bin, and if yes, then how? The problem of weighted balls is of practical relevance. Balls-into-bins games are frequently used to conveniently model load balancing problems. Here, weights can be used to model resource requirements of the jobs, i.e., memory or running time. (C) 2008 Elsevier B.V. All rights reserved.

引用

页码：511 / 520

页数：10

共 50 条

[1] On weighted balls-into-bins games
Berenbrink, P
Friedetzky, T
Hu, ZJ
Martin, R
STACS 2005, PROCEEDINGS, 2005, 3404 : 231 - 243
[2] The (1+β)-Choice Process and Weighted Balls-into-Bins
Peres, Yuval
Talwar, Kunal
Wieder, Udi
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1613 - 1619
[3] Self-Stabilizing Repeated Balls-into-Bins
Becchetti, Luca
Clementi, Andrea
Natale, Emanuele
Pasquale, Francesco
Posta, Gustavo
SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 332 - 339
[4] Self-stabilizing repeated balls-into-bins
Becchetti, L.
Clementi, A.
Natale, E.
Pasquale, F.
Posta, G.
DISTRIBUTED COMPUTING, 2019, 32 (01) : 59 - 68
[5] Self-stabilizing repeated balls-into-bins
L. Becchetti
A. Clementi
E. Natale
F. Pasquale
G. Posta
Distributed Computing, 2019, 32 : 59 - 68
[6] Brief Announcement: A Generalization of Multiple Choice Balls-into-Bins
Park, Gahyun
PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 297 - 298
[7] A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
Gahyun Park
Algorithmica, 2017, 77 : 1159 - 1193
[8] A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
Park, Gahyun
ALGORITHMICA, 2017, 77 (04) : 1159 - 1193
[9] Brief Announcement: Tight Bounds for Repeated Balls-into-Bins
Los, Dimitrios
Sauerwald, Thomas
PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 419 - 421
[10] A Modified Balls-into-Bins Model for Expected Buffer Occupancy in Mobile Opportunistic Networks
Goudar, Gourish
Batabyal, Suvadip
2019 15TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC), 2019, : 1488 - 1493

← 1 2 3 4 5 →