On weighted balls-into-bins games

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 231-243

  Berenbrink, Petra ^a   Friedetzky, Tom ^b   Hu, Zengjian ^a   Martin, Russell ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; PARAMETER ESTIMATION; STORAGE ALLOCATION (COMPUTER);

RUNNING TIME; SINGLE CHOICE GAMES; WEIGHTED BALLS;

COMPUTER SCIENCE;

EID: 24144502333     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_19     Document Type: Conference Paper

References (19)

1. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced Allocations. SIAM J. Computing 29 (1999), pp. 180-200.
2. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced Allocations: The Heavily Loaded Case. Proc. of the 30th Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 745-754.
3. Russ Bubley, Martin E. Dyer: Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. Proc. of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 223-231.
4. Petra Berenbrink: Randomized Allocation of Independent Tasks. University of Paderborn (2000).
5. Petra Berenbrink, Priedhelm Meyer auf der Heide, Klaus Schröder: Allocating Weighted Jobs in Parallel. Theory of Computing Systems 32 (1999), pp. 281-300.
6. Chang Cheng-Shang: A New Ordering for Stochastic Majorization: Theory and Applications. Advances in Applied Probability 24 (1992), pp. 604-634.
7. Artur Czumaj: Recovery Time of Dynamic Allocation Processes. Theory of Computing Systems 33 (2000), pp. 465-487.
8. Artur Czumaj, Volker Stemann: Randomized Allocation Processes. Random Structures and Algorithms 18 (2001), pp. 297-331.
9. Artur Czumaj, Chris Rily, Christian Scheideler: Perfectly Balanced Allocation. Proc. of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003), pp. 240-251.
10. Richard M. Karp, Michael Luby, Priedhelm Meyer auf der Heide: Efficient PRAM Simulation on a Distributed Memory Machine. Proc. of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1992), pp. 318-326.
11. Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. Theory of Computing Systems 36 (2003), pp. 683-693.
12. Albert W. Marshall, Ingram Olkin: Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.
13. Michael Mitzenmacher, Andrea W. Richa, Ramesh Sitaraman: The Power of Two Random Choices: A Survey of Techniques and Results. Handbook of Randomized Computing, 2000.
14. Michael Mitzenmacher, Balaji Prabhakar, Devarat Shah: Load Balancing with Memory. Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 799-808.
15. Rajeev Motwani, Prabhakar Raghavan: Randomized Algorithms, Cambridge University Press, 1995.
16. Sinclair: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkháuser, Boston, MA, 1993.
17. Volker Stemann: Parallel Balanced Allocations. Proc. of the 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996), pp. 261-269.
18. Peter Sanders, Sebastian Egner, Jan H. M. Korst: Fast Concurrent Access to Parallel Disks. Algorithmica 35 (2003), pp. 21-55.
19. Berthold Vöcking: How Asymmetry Helps Load Balancing. Proc. of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1999), pp. 131-140.