Studying Balanced Allocations with Differential Equations

Combinatorics Probability and Computing

Volumn 8, Issue 5, 1999, Pages 473-482

  Mitzenmacher, Michael ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033270230     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399003946     Document Type: Article

References (21)

1. Azar, Y., Broder, A., Karlin, A. and Upfal, E. (1994) Balanced allocations. In Proceedings of the 26th ACM Symposium on the Theory of Computing, pp. 593-602.
2. Achlioptas, D. and Molloy, M. (1997) The analysis of a list-coloring algorithm on a random graph. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pp. 204-212.
3. Alanyali, M. and Hajek, B. (1997) Analysis of simple algorithms for dynamic load balancing. Mathematics of Operations Research 22 840-871.
4. Alon, N., Spencer, J. and Erdos, P. (1992) The Probabilistic Method, Wiley.
5. Azuma, K. (1967) Weighted sums of certain dependent random variables. Tôhoku Mathematical Journal 19 357-367.
6. Czumaj, A. and Stemann, V. (1997) Randomized allocation processes. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pp. 194-203.
7. Eager, D. L., Lazowska, E. D. and Zahorjan, J. (1986) Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Software Engineering 12 662-675.
8. Gonnet, G. (1981) Expected length of the longest probe sequence in hash code searching. J. Assoc. Comput. Mach. 28 289-304.
9. Hajek, B. (1988) Asymptotic analysis of an assignment problem arising in a distributed communications protocol. In Proceedings of the 27th IEEE Conference on Decision and Control, pp. 1455-1459.
10. Karp, R. M., Luby, M. and Meyer auf der Heide, F. (1992) Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th ACM Symposium on the Theory of Computing, pp. 318-326.
11. Karp, R. M. and Sipser, M. (1981) Maximum matchings in sparse random graphs. In Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science, pp. 364-375.
12. Karp, R. M., Vazirani, U. V. and Vazirani, V. V. (1990) An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd ACM Symposium on the Theory of Computing, pp. 352-358.
13. Kurtz, T. G. (1970) Solutions of ordinary differential equations as limits of pure jump Markov processes. J. Appl. Probab. 7 49-58.
14. Kurtz, T. G. (1981) Approximation of Population Processes, SIAM.
15. Luby, M., Mitzenmacher, M., Shokrollahi, M. A., Spielman, D. and Stemann, V. (1997) Practical loss-resilient codes. In Proceedings of the 29th ACM Symposium on the Theory of Computing, pp. 150-159.
16. Mitzenmacher, M. (1996) Load balancing and density dependent jump Markov processes. In Proc. of the 37th IEEE Symp. on Foundations of Computer Science, pp. 213-222.
17. Mitzenmacher, M. (1996) The power of two choices in randomized load balancing. PhD thesis, University of California, Berkeley.
18. Shwartz, A., Weiss, A. (1995) Large Deviations for Performance Analysis, Chapman and Hall.
19. Stemann, V. (1996) Parallel balanced allocations. In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 261-269.
20. Vvedenskaya, N. D., Dobrushin, R. L. and Karpelevich, F. I. (1996) Queueing system with selection of the shortest of two queues: an asymptotic approach. Problems of Information Transmission 32 15-27.
21. Wormald, N. C. (1995) Differential equations for random processes and random graphs. Ann. Appl. Probab. 5 1217-1235.