Balanced allocations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 593-602

  Azar, Y ^a   Broder, A Z ^b   Karlin, A R ^b   Upfal, E ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEWLETT PACKARD COMPANY   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED ALLOCATION; DYNAMIC RESOURCE ALLOCATIONS; HIGH PROBABILITY; LINE LOADS;

COMPUTATION THEORY; RANDOM PROCESSES;

ALGORITHMS; COMPUTER SCIENCE; DATA PROCESSING; MATHEMATICAL MODELS; PROBABILITY; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

BALANCED ALLOCATIONS; RANDOM ALLOCATION PROCESSES;

EID: 0028092498     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195412     Document Type: Conference Paper

References (17)

1. N. Alon and J. Spencer. The probabilistic method. John Wiley and Sons, 1992.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts. Online machine scheduling with applications to load balancing and virtual circuit routing. In Proc. of 25th Symposium on Theory of Computing, pp. 164-173, 1993.
3. B. Awerbuch, Y. Azar and S. Plotkin. Throughput competitive online routing. In Proceedings of the 34 th IEEE Conference on Foundations of Computer Science, pp. 32-40, 1993.
4. B. Awerbuch, Y. Azar, S. Plotkin and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proceedings of 5th ACM/SI AM Symposium on Discrete Algorithms, pp. 321-327, 1994.
5. Y. Azar, A. Z. Broder and A .R. Karlin. Online load balancing. In Proceedings of the 33rd IEEE Conference on Foundations of Computer Science, 1992.
6. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, O. Waarts. Online load balancing of temporary tasks. In Proceedings of the Workshop on Algorithms' and Data Structures, pp. 119-130, August, 1993.
7. Y. Azar, J. Naor and R. Rom. The competitiveness of online assignment. In Proceedings of 3rd ACM/SIAM Symposium on Discrete Algorithms, pp. 203-210, 1992.
8. A. Broder and A. Karlin. Multi-level Adaptive Hashing. In Proceedings of 1st ACM/SIAM Symposium on Discrete Algorithms, January, 1990.
9. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer Heide, H. Rohnert, R. Tarjan. Dynamic Perfect Hashing - Upper and Lower Bounds In Proceedings of the 29th IEEE Conference on Foundations of Computer Science, 1988.
10. M. L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with 0(1) worst case access time. Journal of the ACM, 31:538-544, 1984.
11. Gaston H. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the ACM, 28(2):289-304, April 1981.
12. Norman L. Johnson and Samuel Kotz. Urn Models and Their Application. John Wiley & Sons, 1977.
13. Richard M. Karp, Michael Luby, and Friedhelm Meyer Heide. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992.
14. R. M. Karp and U. V. Vazirani and V. V. Vazirani. An Optimal Algorithm for On-Line Bipartite Matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.
15. Valentin F. Kolchin, Boris A. Sevastyanov, and Valdimir P. Chistyakov. Random Allocations. John Wiley & Sons, 1978.
16. S.J. Phillips and J. Westbrook. Online load balancing and network flow. In Proceedings of the 25th Annual A CM Symposium on Theory of Computing, 1993.
17. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, February 1985.