Article

Free access

Approximate load balancing on dynamic and asynchronous networks

Authors:

William Aiello,

Baruch Awerbuch,

Bruce Maggs,

Satish RaoAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 632 - 641

https://doi.org/10.1145/167088.167250

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

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.

Digital Library

Google Scholar

[2]

D. Aidous and P. Diaconis. Strong uniform times and finite random walks. Advances in Applied Mathematics, 8:69-97, 1987.

Digital Library

Google Scholar

[3]

Yehuda Afek, Eli Gafni, and Adi Rosen. Slide - a technique for communication in unreliable networks. In Proc. 11th A CM Symp. on Principles of Distributed Computing, pages 35-46, August 1992.

Digital Library

Google Scholar

[4]

J. Aspnes, M. Herlihy, and N. Shavit. Counting networks and multi-processor coordination. In Proc. 23rd ACM Syrup. on Theory of Computing, pages 348-358, May 1991.

Digital Library

Google Scholar

[5]

W. Aiello and T. Leighton. Coding theory, hypercube embeddings, and fault tolerance. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 125-136, July 1991.

Digital Library

Google Scholar

[6]

D. Aldous. Random walks on finite groups and rapidly mixing markov chains. Seminaire de Probabilities XVII Lecture Notes in Mathematics, 986, 1983.

Google Scholar

[7]

D. Aldous. On the markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in Eng. and Inf. Sci., 1:33-46, 1987.

Crossref

Google Scholar

[8]

N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.

Digital Library

Google Scholar

[9]

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.

Google Scholar

[10]

Baruch Awerbuch, Boaz Patt-Shamir, and George Varghese. Self-stabilization by local checking and correction. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 268-277, October 1991.

Digital Library

Google Scholar

[11]

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.

Digital Library

Google Scholar

[12]

J. Hastad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Proceedings of the 21st Annual A CM Symposium on Theory of Computing, pages 251-263, May 1989.

Digital Library

Google Scholar

[13]

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 Architectures, pages 219-227, June 1992.

Digital Library

Google Scholar

[14]

Maurice Hedihy, Nit Shavit, and Orly Waarts. Low contention linearizable counting. In Proc. 32nd IEEE Syrup. on Foundations of Computer Science, pages 526-535, October 1991.

Digital Library

Google Scholar

[15]

M.R. Jemun and A. Sinclair. Conductance and the rapid mixing property for markov chains: the approximation of the permanent resolved. In Proc. 20th A CM Syrup. on Theory of Computing, pages 235-244, 1988.

Digital Library

Google Scholar

[16]

C. Kaklamanis, A. R. Karlin, E T. Leighton. V. Milenkovic. P. Raghavan. S. Rao, C. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Proceedings of the 31 st Annual Symposium on Foundations of Computer Science, pages 285-296, October 1990.

Digital Library

Google Scholar

[17]

Michael Klugerman and Greg Plaxton. Small-depth counting networks. In Proc. 24th ACM Symp. on Theory of Computing, pages 417-428, May 1992.

Digital Library

Google Scholar

[18]

E T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays ~ Trees ~ Hypercubes. Morgan-Kaufman, San Mateo, CA, 1992.

Digital Library

Google Scholar

[19]

T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 384-389, October 1989.

Digital Library

Google Scholar

[20]

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 Foundations of Computer Science, pages 542-552, October 1992.

Digital Library

Google Scholar

[21]

Y.-D. Lyuu. Fast fault-tolerant parallel communication and on-line maintenance using information dispersal, in Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 378-387, July 1990.

Digital Library

Google Scholar

[22]

Milena Mihail. Conductance and convergence of markov chains - a combinatorial treatment of expanders. In Proc. 30th IEEE Syrup. on Foundations of Computer Science, pages 526-531, October 1989.

Digital Library

Google Scholar

[23]

D. Peleg and E. Upfal. The token distribution problem. SIAMJ. on Comput., 18:229- 243, 1989.

Digital Library

Google Scholar

[24]

N. Pippenger and L. G. Valiant. Shifting graphs and their applications. J. of the ACM, 23:423-432, 1976.

Digital Library

Google Scholar

[25]

M.O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. of the ACM, 36(3):335-348, 1989.

Digital Library

Google Scholar

Cited By

View all

Dinitz YDolev SKumar M(2022)Local Deal-Agreement Algorithms for Load Balancing in Dynamic General GraphsTheory of Computing Systems10.1007/s00224-022-10097-667:2(348-382)Online publication date: 29-Nov-2022
https://doi.org/10.1007/s00224-022-10097-6
Dinitz YDolev SKumar M(2020)Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General GraphsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-64348-5_9(113-117)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64348-5_9
Жилякова Zhilyakova LКузнецов Kuznetsov O(2016)Resource network theory10.12737/21451Online publication date: 6-Dec-2016
https://doi.org/10.12737/21451
Show More Cited By

Index Terms

Approximate load balancing on dynamic and asynchronous networks

Recommendations

Elastic Load Balancing Classic Load Balancers
Elastic Load Balancing Application Load Balancers
Dynamic Load Balancing and Efficient Load Estimators for Asynchronous Iterative Algorithms

In a previous paper [CHECK END OF SENTENCE], we have shown the very high power of asynchronism for parallel iterative algorithms in a global context of grid computing. In this article, we study the interest of coupling load balancing with asynchronism ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
539
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)6

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dinitz YDolev SKumar M(2022)Local Deal-Agreement Algorithms for Load Balancing in Dynamic General GraphsTheory of Computing Systems10.1007/s00224-022-10097-667:2(348-382)Online publication date: 29-Nov-2022
https://doi.org/10.1007/s00224-022-10097-6
Dinitz YDolev SKumar M(2020)Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General GraphsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-64348-5_9(113-117)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64348-5_9
Жилякова Zhilyakova LКузнецов Kuznetsov O(2016)Resource network theory10.12737/21451Online publication date: 6-Dec-2016
https://doi.org/10.12737/21451
El Chamie MLiu JBasar T(2016)Design and Analysis of Distributed Averaging With Quantized CommunicationIEEE Transactions on Automatic Control10.1109/TAC.2016.253093961:12(3870-3884)Online publication date: Dec-2016
https://doi.org/10.1109/TAC.2016.2530939
Akbari HBerenbrink PSauerwald T(2016)A simple approach for adapting continuous load balancing processes to discrete settingsDistributed Computing10.1007/s00446-016-0266-y29:2(143-161)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s00446-016-0266-y
Feuilloley LHirvonen JSuomela J(2015)Locally Optimal Load BalancingProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_36(544-558)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_36
Sharma GRai SBusch CTrahan JVaidyanathan R(2014)Work-Efficient Load BalancingProceedings of the 2014 43rd International Conference on Parallel Processing Workshops10.1109/ICPPW.2014.17(27-36)Online publication date: 9-Sep-2014
https://dl.acm.org/doi/10.1109/ICPPW.2014.17
Friedrich TGairing MSauerwald TCharikar M(2010)Quasirandom load balancingProceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms10.5555/1873601.1873733(1620-1629)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.5555/1873601.1873733
Dimakis AKar SMoura JRabbat MScaglione A(2010)Gossip Algorithms for Distributed Signal ProcessingProceedings of the IEEE10.1109/JPROC.2010.205253198:11(1847-1864)Online publication date: Nov-2010
https://doi.org/10.1109/JPROC.2010.2052531
Franceschelli MGiua ASeatzu C(2009)Load balancing over heterogeneous networks with gossip-based algorithmsProceedings of the 2009 conference on American Control Conference10.5555/1702315.1702643(1987-1993)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.5555/1702315.1702643
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Elastic Load Balancing Classic Load Balancers

Elastic Load Balancing Application Load Balancers

Dynamic Load Balancing and Efficient Load Estimators for Asynchronous Iterative Algorithms