Load balancing with memory

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 799-808

  Mitzenmacher, Michael ^a   Prabhakar, Balaji ^b   Shah, Devavrat ^b  

^a HARVARD UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; DATA HANDLING; DATA STRUCTURES; MAXIMUM PRINCIPLE; PROBABILITY DISTRIBUTIONS; QUEUEING THEORY; TIME SHARING PROGRAMS;

ASYMPTOTIC MAXIMUM LOAD; LOAD BALANCING MODEL;

COMPUTER SCIENCE;

EID: 0036957038     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal, Balanced Allocations. SIAM Journal of Computing, 29: 1, pp. 180-200, 1999.
2. A. Czumaj and V. Stemann. Randomized Allocation Processes. In Proceeding of the 38th FOCS, pp. 194-203, 1997.
3. M. Dahlin, Interpreting Stale Load Information. IEEE Transactions on Parallel and Distributed Systems, 11 (10), pp. 1033-1047, October 2000.
4. S. N. Ethier and T. G. Kurtz. Markov Processes: Characterization and Convergence, John Wiley & Sons, New York, 1986.
5. P. Giaccone, B. Prabhakar, and D. Shah, Towards Simple High-Performance Scheduler for Input Queued Switches. To appear at IEEE INFOCOM 2002.
6. R. J. Gibbens, F. P. Kelly, and P. B. Key, Dynamic Alternative Routing - Modelling and Behavior, In Proceedings of the 12 International Teletraffic Congress, June 1988.
7. M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, PhD thesis, University of California, Berkeley, 1996.
8. Journal article appears as: The Power of Two Choices in Randomized Load Balancing, IEEE Transactions on Parallel and Distributed Systems, 12:10, pp: 1094-1104, October 2001.
9. M. Mitzenmacher, A. Richa, and R. Sitaraman, The Power of Two Random Choices: a Survey of Techniques and Results. In the Handbook of Randomized Computing, vol. 1, pp. 255-312 edited by P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, Kluwer Press.
10. M. Mitzenmacher, and B. Vocking, The Asymptotics of Selecting the Shortest of Two, Improved. In Proceedings of 27th Annual Allerton Conference on Communication, Control, and Computing, pp. 326-327, 1999. to appear in a memorial volume for F. Karpelevich.
11. K. Psounis, B. Prabhakar and D. Engler, A Randomized Cache Replacement Scheme for Approximating LRU. In Proceedings of the 34th Annual Conf. of Information Sciences and Systems, Princeton, March 2000.
12. D. Shah and B. Prabhakar, The Use of Memory in Randomized Load Balancing. Submitted, Short summary appears in Proceedings of the ISIT, pp. 125, Laussane, Switzerland, July 2002.
13. A. Shwartz and A. Weiss. Large Deviations for Performance Analysis: Queues, Communication, and Computing, Stochastic Modelling Series, Chapman & Hall, London, 1995.
14. L. Tassiulas, Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input Queued Switches. In Proceedings IEEE INFOCOM 1998, vol. 2, pp. 533-539, New York, NY.
15. B. Vöcking, How Asymmetry Helps Load Balancing. In Proceeding of 40th IEEE-FOCS, New York, 1999; pp. 131-140.
16. N. D. Vvedenskaya, R. L. Dobrushin and F. I. Karpelevich. Queueing System with Selection of the Shortest of Two Queues: An Asymptotic Approach. Problems of Information Transmission, 32(1): 15-29, 1996.