Randomized allocation processes

Random Structures and Algorithms

Volumn 18, Issue 4, 2001, Pages 297-331

  Czumaj, Artur ^a   Stemann, Volker ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Load balancing; Occupancy problems; Resource allocation; Urn models

Indexed keywords

EID: 0035611244     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.1011     Document Type: Article

References (45)

1. M. Adler, P. Berenbrink, and K. Schröder, Analyzing an infinite parallel job allocation process, Proc 6th Annual European Symp Algorithms, Venice, Italy, Vol. 1461 of Lecture Notes in Computer Science, (G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. Pucci, Editors), Springer-Verlag, Berlin, 1998, pp. 417-428.
2. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen, Parallel randomized load balancing, Random Struc Algorithms, 13 (1998), 159-188. A preliminary version appeared in Proc 27th Annual ACM Symp Theory of Computing, Las Vegas, NV, ACM Press, New York, 1995, pp. 238-247.
3. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen, Parallel randomized load balancing, Random Struc Algorithms, 13 (1998), 159-188. A preliminary version appeared in Proc 27th Annual ACM Symp Theory of Computing, Las Vegas, NV, ACM Press, New York, 1995, pp. 238-247.
4. M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L.J. Schulman, and O. Waarts, Fairness in scheduling, J Algorithms 29 (1998), 306-357. A preliminary version appeared in Proc 6th Annual ACM-SIAM Symp Discrete Algorithms, San Francisco, SIAM, Philadelphia, 1995, pp. 477-485.
5. M. Ajtai, J. Aspnes, M. Naor, Y. Rabani, L.J. Schulman, and O. Waarts, Fairness in scheduling, J Algorithms 29 (1998), 306-357. A preliminary version appeared in Proc 6th Annual ACM-SIAM Symp Discrete Algorithms, San Francisco, SIAM, Philadelphia, 1995, pp. 477-485.
6. D.J. Aldous, Probability approximations via the Poisson clumping heuristic, Springer-Verlag, New York, 1989.
7. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts, Competitive routing of virtual circuits with unknown duration, Proc 5th Annual ACM-SIAM Symp Discrete Algorithms, Philadelphia, SIAM, Philadelphia, 1994, pp. 321-327.
8. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal, Balanced allocations, SIAM Comput, 29 (1999), 180-200. A preliminary version appeared in Proc 26th Annual ACM Symp Theory of Computing, Montreal, ACM Press, New York, 1994, pp. 593-602.
9. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal, Balanced allocations, SIAM Comput, 29 (1999), 180-200. A preliminary version appeared in Proc 26th Annual ACM Symp Theory of Computing, Montreal, ACM Press, New York, 1994, pp. 593-602.
10. A.D. Barbour, L. Holst, and S. Janson, Poisson approximation, Oxford University Press, New York, 1992.
11. P. Berenbrink, A. Czumaj, T. Friedetzky, and N.D. Vvedenskaya, On the analysis of infinite parallel job allocation processes via differential equations, Proc 12th Annual ACM Symp Parallel Algorithms and Architectures, Bar Harbor, ME, ACM Press, New York, 2000, pp. 99-108
12. P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, Allocating weighted jobs in parallel, Theory Comput Syst, 32 (1999) 281-300. A preliminary version appeared in Proc 9th Annual ACM Symp Parallel Algorithms and Architectures, Newport, RI, ACM Press, New York, 1997, pp. 302-310.
13. P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, Allocating weighted jobs in parallel, Theory Comput Syst, 32 (1999) 281-300. A preliminary version appeared in Proc 9th Annual ACM Symp Parallel Algorithms and Architectures, Newport, RI, ACM Press, New York, 1997, pp. 302-310.
14. A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, New York, 1998.
15. R. Cole, A. Frieze, B.M. Maggs, M. Mitzenmacher, A.W. Richa, R.K. Sitaraman, and E. Upfal, On balls and bins with deletions, Proc 2nd Int Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, Spain, Vol. 1518 of Lecture Notes in Computer Science, (M. Luby, J. Rolim, and M. Serna, Editors), Springer-Verlag, Berlin, 1998, pp. 145-158.
16. R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, and B. Vöcking, Randomized protocols for low-congestion circuit routing in multistage interconnection networks, Proc 30th Annual ACM Symp Theory of Computing, Dallas, ACM Press, New York, 1998, pp. 378-388.
17. R.M. Corless, G.H. Gonnet, D.E.G. Hare, D.J. Jeffrey, and D.E. Knuth, On the Lambert W function, Adv Comput Math 5 (1996), 329-359.
18. A. Czumaj, Recovery time of dynamic allocation processes, Proc 10th Annual ACM Symp Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, ACM Press, New York, 1998, pp 202-211.
19. A. Czumaj and V. Stemann, Randomized allocation processes, Proc 38th IEEE Symp Foundations of Computer Science, Miami Beach, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 194-203.
20. D. Dubhashi and D. Ranjan, Balls and bins: a study in negative dependence, Random Struc Algorithms, 13 (1998) 99-124.
21. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds, Inform Process Lett, 33 (1990), 305-308.
22. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Statist Assoc, 58(301) (1963), 13-30.
23. M. Hofri, Analysis of algorithms: computational methods and mathematical tools, Oxford University Press, New York, 1995.
24. S. Irani and A.R. Karlin, Online computation, Approximation algorithms for script N sign script P sign-hard problems (D.S. Hochbaum, Editor), Chap. 13, PWS Publishing Company, Boston 1996, pp. 521-564.
25. N.L. Johnson and S. Kotz, Urn models and their application: an approach to modern discrete probability theory, John Wiley & Sons, New York, 1977.
26. R.M. Karp, M. Luby, and F. Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine, Algorithmica 16 (1996) 517-542. A preliminary version appeared in Proc 24th Annual ACM Symp Theory of Computing, Victoria, British Columbia, ACM Press, New York, 1992, pp. 318-326.
27. R.M. Karp, M. Luby, and F. Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine, Algorithmica 16 (1996) 517-542. A preliminary version appeared in Proc 24th Annual ACM Symp Theory of Computing, Victoria, British Columbia, ACM Press, New York, 1992, pp. 318-326.
28. V.F. Kolchin, B.A. Sevast'yanov, and V.P. Chistyakov, Random allocations, VH Winston & Sons, Washington, DC, 1978.
29. R. Lüling and B. Monien, A dynamic distributed load balancing algorithm with provable good performance, Proc 5th Annual ACM Symp Parallel Algorithms and Architectures, Velen, Germany, ACM Press, New York, 1993, pp. 164-172,
30. P.D. MacKenzie, C.G. Plaxton, and R. Rajaraman, On contention resolution protocols and associated probabilistic phenomena, J ACM, 45 (1998) 324-378. A preliminary version appeared in Proc 26th Annual ACM Symp Theory of Computing, Montreal, ACM Press, New York, 1994, pp. 153-162.
31. P.D. MacKenzie, C.G. Plaxton, and R. Rajaraman, On contention resolution protocols and associated probabilistic phenomena, J ACM, 45 (1998) 324-378. A preliminary version appeared in Proc 26th Annual ACM Symp Theory of Computing, Montreal, ACM Press, New York, 1994, pp. 153-162.
32. C. McDiarmid, On the method of bounded differences, Surveys in Combinatorics, (J. Siemons, Editor), London Mathematical Society Lecture Note Series 141, Cambridge University Press, Cambridge, UK, 1989, pp. 148-188.
33. M. Mitzenmacher, Load balancing and density dependent jump Markov processes, Proc 37th IEEE Symp Foundations of Computer Science, Burlington, VT, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 213-222.
34. M. Mitzenmacher, How useful is old information, Proc 16th ACM Symp Principles of Distributed Computing, Santa Barbara, CA, ACM Press, New York, 1997, pp. 83-91.
35. M. Mitzenmacher, On the analysis of randomized load balancing schemes, Proc 9th Annual ACM Symp Parallel Algorithms and Architectures, Newport, RI, ACM Press, New York, 1997, pp. 292-301.
36. M. Mitzenmacher, Studying balanced allocations with differential equations, Combin, Probab Comput 8 (1999) 473-82.
37. M. Mitzenmacher, Analyses of load stealing models based on differential equations, Proc 10th Annual ACM Symp Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, ACM Press, New York, 1998, pp. 212-221.
38. M.D. Mitzenmacher, The power of two choices in randomized load balancing, PhD thesis, Computer Science Department, University of California at Berkeley, September 1996.
39. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, New York, 1995.
40. B. Pittel, J. Spencer, and N. Wormald, Sudden emergence of a giant k-core in a random graph, J combin Theory Ser A, (1996), 111-151.
41. M. Raab and A. Steger, "Balls into bins" - a simple and tight analysis, Proc 2nd Int Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, Spain, Vol. 1518 of Lecture Notes in Computer Science, (M. Luby, J. Rolim, and M. Serna, Editors), Springer-Verlag, Berlin, 1998, pp. 159-170.
42. V. Stemann, Parallel balanced allocations, Proc 8th Annual ACM Symp Parallel Algorithms and Architectures, Padua, Italy, ACM Press, New York, 1996, pp. 261-269.
43. B. Vöcking, How asymmetry helps load balancing, Proc 40th IEEE Symp Foundations of Computer Science, New York City, IEEE Computer Society Press, Los Alamitos, CA, 1999, pp. 131-141.
44. N.D. Vvedenskaya, R.L. Dobrushin, and F.I. Karpelevich, Queueing system with selection of the shortest of two queues: An asymptotic approach, Problems Inform Transmission 32(1) (1996), 15-27.
45. C. Xu, S. Tschöke, and B. Monien, Performance evaluation of load distribution strategies in parallel branch and bound computations, Proc 7th IEEE Symp Parallel and Distributed Processing, 1995, pp. 402-405.