On balls and bins with deletions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1518, Issue , 1998, Pages 145-158

  Cole, Richard ^a   Frieze, Alan ^b   Maggs, Bruce M ^c   Mitzenmacher, Michael ^d   Richa, Andréa W ^c   Sitaraman, Ramesh ^e   Upfal, Eli ^f  

^a NEW YORK UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Carnegie Mellon University   (United States)

^d HEWLETT PACKARD COMPANY   (United States)

^e Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^f Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK MANAGEMENT; RANDOM PROCESSES;

BUTTERFLY NETWORKS; HIGH PROBABILITY; STATIC LOAD BALANCING;

BINS;

EID: 84958656539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_12     Document Type: Conference Paper

References (12)

1. M. Adler, P. Berenbrink, and K. Schróder. Analyzing an infinite parallel job allocation process. To appear in ESA 98.
2. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel randomized load balancing. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 238-247.
3. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley and Sons, 1992.
4. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994, pp. 593-602.
5. P. Berenbrink, F. Meyer auf der Heide, and K. Schróder. Allocating weighted jobs in parallel. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 302-310.
6. 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. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 378-388.
7. A. Czumaj and V. Stemann. Randomized allocation processes. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997, pp. 194-203.
8. M. Mitzenmacher. Density dependent jump markov processes and applications to load balancing. In Proceedings of the 37th Annual IEEE Symposium on Founda- tions of Computer Science, 1996, pp. 213-223.
9. M. Mitzenmacher. On the analysis of randomized load balancing schemes. In Pro- ceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 292-301.
10. M. Mitzenmacher. Studying balanced allocations with differential equations. Technical Note 1997-2024, Digital Equipment Corporation Systems Research Center, Palo Alto, CA, October 1997.
11. M. Mitzenmacher, How useful is old information? In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, 1997, pp. 83-91. Extended version available as Digital Systems Research Center Technical Note 1998-003.
12. V. Stemann. Parallel balanced allocations. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 261-269.