Approximate load balancing on dynamic and asynchronous networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 632-641

  Aiello, William ^a   Awerbuch, Baruch ^b   Zkfaggs, Bruce ^c   Rao, Satish ^c  

^a TELCORDIA TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY; ALGORITHMS; DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS NETWORKS; DISTRIBUTED NETWORKS; EXPANSION PROPERTIES; FIXED TOPOLOGIES; INITIAL IMBALANCE; LOCAL ALGORITHM; MAXIMUM DEGREE; SYNCHRONOUS NETWORKS;

COMPUTATION THEORY; COMPUTER NETWORKS;

APPROXIMATE LOAD BALANCING; DYNAMIC AND ASYNCHRONOUS NETWORKS;

EID: 0027150660     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167250     Document Type: Conference Paper

References (25)

1. [AB92] Y. Aumann and M. Ben-Or. Computing with faulty arrays. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 162-169, May 1992.
2. [AD87] D. Aldous and P. Diaconis. Strong uniform times and finite random walks. Advances in Applied Mathematics, 8:69-97, 1987.
3. [AGR92] Yehuda Afek, Eli Gafhi, and Adi Rosen. Slide -A technique for communication in unreliable networks. In Proc. 11th ACM Symp. on Principles of Distributed Com-puting, pages 35-46, August 1992.
4. [AHS91] J. Aspnes, M. Herlihy, and N. Shavit. Counting networks and multi-processor co-ordination. In Proc. 23rd ACM Symp. on Theory of Computing, pages 348-358, May 1991.
5. [AL91] W. Aiello and T. Leighton. Coding the-ory, hypercube embeddings, and fault tol-erance. In Proceedings of the 3rd An-nual ACM Symposium on Parallel Algo-rithms and Architectures, pages 125-136, July 1991.
6. [Ald83] D. Aldous. Random walks on finite groups and rapidly mixing markov chains. Semi-naire de Probabilities XVII Lecture Notes in Mathematics, 986, 1983.
7. [Ald87] D. Aldous. On the markov chain simulation method for uniform combinatorial distribu-Tions and simulated annealing. Probability in Eng. and Inf. Sci., 1:33-46, 1987.
8. [AI086] N. Alon. Eigenvalues and expanders. Com- binatorica, 6(2):83-96, 1986.
9. [AMS89] Baruch Awerbuch, Yishay Mansour, and Nir Shavit. End-To-end communication with polynomial overhead. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 358-363, October 1989.
10. [APV91] Baruch Awerbuch, Boaz Patt-Shamir, and George Varghese. Self-stabilization by lo-cal checking and correction. In Proc. 32 nd IEEE Symp. on Foundations of Computer Science, pages 268-277, October 1991.
11. [HLN87] J. Hastad, T. Leighton, and M. Newman. Reconfiguring a hypercube in the presence of faults. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 274-284, May 1987.
12. [HLN89] J. Hastad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 251-263, May 1989.
13. [HLS92] Maurice Herlihy, Beng-Hong Lim, and Nir Shavit. Low contention load balancing on large-scale multiprocessors. In 4'th ACM Symposium on Parallel Algorithms and Ar-chitectures, pages 219-227, June 1992.
14. [HSW91] Maurice Herlihy, Nir Shavit, and Orly Waarts. Low contention linearizable count-ing. In Proc. 32ndIEEE Symp. on Founda-Tions of Computer Science, pages 526-535, October 1991.
15. [JS88] M.R. Jerrum and A. Sinclair. Conductance and the rapid mixing property for markov chains: The approximation of the perma-nent resolved. In Proc. 20th ACM Symp. on Theory of Computing, pages 235-244, 1988.
16. [KKL+90] C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Pro-ceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 285-296, October 1990.
17. [KP92] Michael Klugerman and Greg Plaxton. Small-depth counting networks. In Proc. 24th ACM Symp. on Theory of Computing, pages 417-428, May 1992.
18. [Lei92] F. T. Leighton. Introduction to Parallel Al-gorithms and Architectures: Arrays • Trees • Hypercubes. Morgan-Kaufman, San Ma-Teo, CA, 1992.
19. [LM89] T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Sympo-sium on Foundations of Computer Science, pages 384-389, October 1989.
20. [LMS92] T. Leighton, B. Maggs, and R. Sitaraman. On the fault tolerance of some popular bounded-degree networks. In Proceedings of the 33rd Annual Symposium on Founda-Tions of Computer Science, pages 542-552, October 1992.
21. [Lyu90] Y.-D. Lyuu. Fast fault-Tolerant parallel communication and on-line maintenance using information dispersal. In Proceed-ings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 378-387, July 1990.
22. [Mih89] Milena Mihail. Conductance and conver-gence of markov chains -A combinatorial treatment of expanders. In Proc. 30th IEEE Symp. on Foundations of Computer Sci-ence, pages 526-531, October 1989.
23. [PU89] D. Peleg and E. Upfal. The token distribu-Tion problem. SIAM J. on Comput., 18:229- 243, 1989.
24. [PV76] N. Pippenger and L. G. Valiant. Shifting graphs and their applications. J. of the ACM, 23:423-432, 1976.
25. [Rab89] M. O. Rabin. Efficient dispersal of informa-Tion for security, load balancing, and fault tolerance. J. of the ACM, 36(3):335-348, 1989.