Skip to main content
Springer Nature Link
Log in

Load balancing: An exercise in constrained convergence

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 972))

Included in the following conference series:

  • 143 Accesses

  • 4 Citations

Abstract

We consider the problem of load balancing to illustrate the design and analysis of distributed control based on a generalized form of stabilization. We call this form of stabilization constrained convergence. Constrained convergence yields novel, fully distributed, global load balancing programs which are (i) adaptive, (ii) fault-tolerant and, most notably, (iii) the first such programs to exhibit stability while interacting with any possible environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. J. A. Stankovik: Stability and distributed scheduling algorithms. IEEE Transactions on Software Engineering SE-11(1O) (1985) 1141–1152

    Google Scholar 

  2. D. L. Eager, E.D. Lazowska, J. Zahorjan: Adaptive load sharing in homogeneous distributed systems. IEEE Transactions on Software Engineering 12(5) (1986) 662–675

    Google Scholar 

  3. F. Cristian: Understanding fault-tolerant distributed systems. Communications of the ACM 34(2) (1991) 56–78

    Article  Google Scholar 

  4. E. W. Dijkstra: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11) (1974) 643–644

    Article  Google Scholar 

  5. A. Arora, M. G. Gouda: Load balancing: An exercise in constrained convergence. Paper presented to The Austin Tuesday Afternoon Club (1990)

    Google Scholar 

  6. M. G. Gouda, T. Herman: Adaptive programming. IEEE Transactions on Software Engineering 17(9) (1991) 911–921

    Article  Google Scholar 

  7. A. Arora, M. G. Gouda, T. Herman: Composite routing protocols. Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing (1990) 70–78

    Google Scholar 

  8. A. Arora: A foundation of fault-tolerant computing. PhD Dissertation, The University of Texas at Austin (1992) ftp://ftp.cis.ohio-state.edu/pub/anish/dissertation/body.ps.Z

    Google Scholar 

  9. A. Arora, M. G. Gouda: Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering 19(11) (1993) 1015–1027

    Article  Google Scholar 

  10. A. Arora, M. G. Gouda: Distributed reset. IEEE Transactions on Computers 43(9) (1994) 1026–1038

    Article  Google Scholar 

  11. A. Arora, A. Singhai: Fault-tolerant reconfiguration of trees and rings in networks. Journal of High Integrity Design. to appear

    Google Scholar 

  12. C.-Y. H. Hsu, J. W.-S. Liu: Dynamic load balancing algorithms in homogeneous distributed systems. Proceedings of 16th International Conference on Distributed Computer Systems (1986) 216–223

    Google Scholar 

  13. H. S. Stone: Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Computers 4(3) (1978) 254–258

    Google Scholar 

  14. D. L. Eager, E. D. Lazowska, J. Zahorjan: A comparison of receiver-initiated and sender-initiated dynamic load sharing. Performance Evaluation 6(1) (1986) 53–68

    Article  Google Scholar 

  15. J. A. Stankovik: A perspective on distributed computer systems. IEEE Transactions on Computers 33(12) (1984) 1102–1115

    Google Scholar 

  16. N. G. Shivaratri, P. Krueger, M. Singhal: Load distributing for locally distributed systems. IEEE Computer 25(12) (1994) 33–45

    Google Scholar 

  17. F. C. H. Lin, R. Keller: The gradient model load balancing method. IEEE Transactions on Software Engineering 13(1) (1987) 32–38

    Google Scholar 

  18. M. K. Kam, F. B. Bastani: A self-stabilizing ring protocol for load balancing in distributed real-time process control systems. Technical Report #UH-CS-87-9, Department of Computer Science, University of Houston (1987)

    Google Scholar 

  19. I.-L. Yen, F. B. Bastani: Robust coordination in distributed multi-server systems. Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems (1994) 133–138

    Google Scholar 

  20. E. Cohen: On the convergence span of greedy load balancing. Information Processing Letters (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer & Inf. Science, The Ohio State University, 43210, Columbus, OH

    Anish Arora

  2. Dept. of Computer Sciences, The University of Texas, 78712, Austin, TX

    Mohamed Gouda

Authors
  1. Anish Arora
    View author publications

    Search author on:PubMed Google Scholar

  2. Mohamed Gouda
    View author publications

    Search author on:PubMed Google Scholar

Editor information

Jean-Michel Hélary Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arora, A., Gouda, M. (1995). Load balancing: An exercise in constrained convergence. In: Hélary, JM., Raynal, M. (eds) Distributed Algorithms. WDAG 1995. Lecture Notes in Computer Science, vol 972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022147

Download citation

  • DOI: https://doi.org/10.1007/BFb0022147

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60274-3

  • Online ISBN: 978-3-540-44783-2

  • eBook Packages: Springer Book Archive

Keywords

Publish with us

Policies and ethics