Article

Free access

An adversarial model for distributed dynamic load balancing

Authors:

S. Muthukrishnan,

Rajmohan RajaramanAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 47 - 54

https://doi.org/10.1145/277651.277669

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

The collection of computer science bibliographies: Bibliography on load balancing. At UlZL http://liinww w. ir a.uka.de/bibliography/Parallel/ Load.Balance. 1.html.

Google Scholar

[2]

References to online documents about process migration, checkpointing and load balancing. At UlZL http://wwwbode.informatik.tumuenchen.de/~petri/pbeamrefs.html.

Google Scholar

[3]

W. Aiello, B. Awerbuch, B. Maggs, and S. lZao. Approximate load balancing on dynamic and asynchronous networks. In Proceedings of the 25th Annual A CM Symposium on Theory of Computing, pages 632-641, May 1993.

Digital Library

Google Scholar

[4]

N. Alon, G. Kalai, M. lZicklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theoretical Computer Science, 130:175-201, 1994.

Digital Library

Google Scholar

[5]

M. Andrews, B. Awerbuch, A. Fern~ndez, :I. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 380-389, October 1996.

Digital Library

Google Scholar

[6]

B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In Proceedings of the 2#th Annual A CM Symposium on Theory of Computing, pages 571-580, May 1992.

Digital Library

Google Scholar

[7]

B. Awerbuch and F. T. Leighton. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In Proceedings of the 26th Annual A CM Symposium on Theory of Computing, pages 487-496, May 1994.

Digital Library

Google Scholar

[8]

B. Awerbuch and T. Leighton. A simple local-control approximation algorithm for multicommodity flow. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 459-468, October 1993.

Digital Library

Google Scholar

[9]

A. Borodin, J. Kleinberg, P. tLaghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. In Proceedings of the 28th Annual A CM Symposium on Theory of Computing, pages 376-385# May 1996.

Digital Library

Google Scholar

[10]

G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 2:279-301, 1989.

Digital Library

Google Scholar

[11]

D. Eager, D. Lazowska, and J. Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Transactions on Software Engineering, 12:662-675, 1986.

Digital Library

Google Scholar

[12]

P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 6th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 210-219, June 1994. Journal version to appear in Journal of Parallel and Dislributed Computing.

Digital Library

Google Scholar

[13]

B. Ghosh# F. T. Leighton# B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, i#. tLajaraman, A. W. Pdcha, R. E. Tarjan, and D. Zuckerman. Tight analyses of two local load balancing algorithms. In Proceedings of the 27th Annual A CM Symposium on Theory of Computing, pages 548- 558, May 1995. Journal version to appear in SIAM Journal on Computing.

Digital Library

Google Scholar

[14]

B. Ghosh and S. Muthukrishnan. Dynamic load balancing in parallel and distributed networks by random matchings. In Proceedings of the 6th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 226-235, June 1994.

Digital Library

Google Scholar

[15]

A. Heirich and S. Taylor. A parabolic theory of load balance. Technical Report Caltech-CS-TtL- 93-22, Caltech Scalable Concurrent Computation Lab, March 1993.

Digital Library

Google Scholar

[16]

J. Hong, M. Chen, and X. Tan. Dynamic cyclic load balancing on hypercubes. In Proceedings of the $th Conference on Hypercubes, Concurrent Computers and Applications, pages 595-598, 1989.

Google Scholar

[17]

S. H. Hosseini, B. Litow, M. Malkawi, J. McPherson, and K. Vairavan. Analysis of a graph coloring based distributed load balancing algorithm. Journal of Parallel and Distributed Computing, 10:160- 166, 1990.

Digital Library

Google Scholar

[18]

E. L. Lawler and D. E. Wood. Branch and bound methods: a survey. Operations Research, 14:699- 719, 1966.

Digital Library

Google Scholar

[19]

F. C. H. Lin and tL. M. Keller. The gradient model load balancing method. IEEE Transactions on Software Engineering, 13:32-38, 1986.

Digital Library

Google Scholar

[20]

M. Livny and M. Melman. Load balancing in homogeneous broadcast distributed systems. ACM Performance Evaluation Review, 11(1):47- 55, 1982.

Digital Library

Google Scholar

[21]

F. Meyer auf der Heide, B. Oesterdiekhoff, and It. Wanka. Strongly adaptive token distribution. Algorithmica, 15:413-427, 1996.

Digital Library

Google Scholar

[22]

M. Nuttall. Survey of systems providing process or object migration. Technical Report DOC94/10, Imperial College, London, 1994.

Google Scholar

[23]

D. Peleg and E. Upfal. The generalized packet routing problem. Theoretical Computer Science, 53:281-293, 1987.

Digital Library

Google Scholar

[24]

D. Peleg and E. Upfal. The token distribution problem. SIAM Journal on Computing, 18:229- 243, 1989.

Digital Library

Google Scholar

[25]

C. Phillips, C. Stein, and J. Wein. Task scheduling in networks, in Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, 1994. Journal version to appear in SIAM Journal on Discrete Mathematics.

Digital Library

Google Scholar

[26]

Y. tLabani and t#. Tardos. Distributed packet switching in arbitrary networks. In Proceedings of the 28th Annual A CM Symposium on the Theory of Computing, pages 366-375, May 1996.

Digital Library

Google Scholar

[27]

B. Shirazi, A. Hurzon, and K. Kavi. Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Society Press, 1995.

Digital Library

Google Scholar

[28]

A. N. Tantawi and D. Towsley. Optimal static load balancing in distributed computer systems. Journal of the A CM, 32:445-465, 1985.

Digital Library

Google Scholar

[29]

It. D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Ezperience, 3:457-481, 1991.

Digital Library

Google Scholar

Cited By

View all

(2017)Distributed approach of load balancing in dynamic grid computing environmentInternational Journal of Communication Networks and Distributed Systems10.5555/3140962.314096319:1(1-18)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3140962.3140963
Parter MPeleg DSolomon S(2016)Local-on-average distributed tasksProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884452(220-239)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884452
Boyle EChung KPass R(2015)Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM ProgramsAdvances in Cryptology -- CRYPTO 201510.1007/978-3-662-48000-7_36(742-762)Online publication date: 1-Aug-2015
https://doi.org/10.1007/978-3-662-48000-7_36
Show More Cited By

Index Terms

An adversarial model for distributed dynamic load balancing

Recommendations

An Adversarial Model for Distributed Dynamic Load Balancing
A game-theoretic model for dynamic load balancing in distributed systems
ICAC3 '09: Proceedings of the International Conference on Advances in Computing, Communication and Control

Process of improving the performance of a parallel and distributed system through a redistribution of load among the processors is called load balancing. If it is being done at run time then it treats as dynamic load balancing. In this paper we present ...
Dynamic load balancing in distributed exascale computing systems

According to exascale computing roadmap, the dynamic nature of new generation scientific problems needs an undergoing review in the static management of computing resources. Therefore, it is necessary to present a dynamic load balancing model to manage ...

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

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 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
692
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

(2017)Distributed approach of load balancing in dynamic grid computing environmentInternational Journal of Communication Networks and Distributed Systems10.5555/3140962.314096319:1(1-18)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3140962.3140963
Parter MPeleg DSolomon S(2016)Local-on-average distributed tasksProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884452(220-239)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884452
Boyle EChung KPass R(2015)Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM ProgramsAdvances in Cryptology -- CRYPTO 201510.1007/978-3-662-48000-7_36(742-762)Online publication date: 1-Aug-2015
https://doi.org/10.1007/978-3-662-48000-7_36
Lim SJung KAndrews M(2014)Stability of the max-weight protocol in adversarial wireless networksIEEE/ACM Transactions on Networking10.1109/TNET.2013.228837222:6(1859-1872)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1109/TNET.2013.2288372
Lim SJung KAndrews M(2012)Stability of the Max-Weight protocol in adversarial wireless networks2012 Proceedings IEEE INFOCOM10.1109/INFCOM.2012.6195486(1251-1259)Online publication date: Mar-2012
https://doi.org/10.1109/INFCOM.2012.6195486
Berenbrink PFriedetzky TMartin R(2008)On the Stability of Dynamic Diffusion Load BalancingAlgorithmica10.5555/3118752.311897750:3(329-350)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.5555/3118752.3118977
Andrews MJung KStolyar AJohnson DFeige U(2007)Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loadsProceedings of the thirty-ninth annual ACM symposium on Theory of computing10.1145/1250790.1250813(145-154)Online publication date: 11-Jun-2007
https://dl.acm.org/doi/10.1145/1250790.1250813
Berenbrink PFriedetzky TMartin R(2007)On the Stability of Dynamic Diffusion Load BalancingAlgorithmica10.1007/s00453-007-9081-y50:3(329-350)Online publication date: 1-Nov-2007
https://doi.org/10.1007/s00453-007-9081-y
Ferrante APiuri VCastanier FBagherzadeh NValero MRamirez A(2005)A QoS-enabled packet scheduling algorithm for IPSec multi-accelerator based systemsProceedings of the 2nd conference on Computing frontiers10.1145/1062261.1062298(221-229)Online publication date: 4-May-2005
https://dl.acm.org/doi/10.1145/1062261.1062298
Berenbrink PFriedetzky TMartin R(2005)Dynamic diffusion load balancingProceedings of the 32nd international conference on Automata, Languages and Programming10.1007/11523468_112(1386-1398)Online publication date: 11-Jul-2005
https://dl.acm.org/doi/10.1007/11523468_112
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

An Adversarial Model for Distributed Dynamic Load Balancing

A game-theoretic model for dynamic load balancing in distributed systems

Dynamic load balancing in distributed exascale computing systems