skip to main content
article
Free Access

Optimal load balancing and scheduling in a distributed computer system

Published:01 July 1991Publication History
First page image

References

  1. 1 ALTMAN, E. AND SHWARTZ, A. Optimal priority assignment with general constraints. In Proceedings of the 24th Allerton Conference on Communication, Control and Computing. 1986.Google ScholarGoogle Scholar
  2. 2 EAGER, D. L., LAZOWSKA, E. D., AND ZAHORJAN, J. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Softw. Eng. 12 (1986), 662-675. Google ScholarGoogle Scholar
  3. 3 EAGER, D. L., LAZOWSKA, E. D., AND ZAHORJAN, J. A comparison of receiver-initiated and sender-initiated adaptive load sharing. Perf. Eval. 6 (1986), 53-68. Google ScholarGoogle Scholar
  4. 4 FEDERGRUEN, A.~ AND GROENEVELT~ i"I. M/G/c queuelng systems with multiple customer classes: Characterization and control of achievable performance under nonpreemptive priority rules. Manage. Sci. 34 (I988), 1121-1138. Google ScholarGoogle Scholar
  5. 5 FUJ~SnIGE, S. LexicographicaUy optimal base of a poIymatrold with respect to a weight vector. Math. Op. Res. 5 (1980), 186-196.Google ScholarGoogle Scholar
  6. 6 GELENBE, E., AND MITRANI, I. Analysts and Synthesis of Computer Systems. Academic Press, London, 1980.Google ScholarGoogle Scholar
  7. 7 KLEINROCK, L Queueing Systems. Vol. 2: Computer Applications. Wiley Interscaence, London, 1980.Google ScholarGoogle Scholar
  8. 8 NAIN, P., AND Ross, K.W. Optimal multiplexing of heterogeneous traffic with hard constraint. Perf. Eval. Rev. 14 (1986), 100-108. Google ScholarGoogle Scholar
  9. 9 Ross, K. W., AND CnEN, B. Optimal scheduling of interactive and noninteractive traffic m telecommunication systems. IEEE Auto. Contr. 33 (1988), 261-267.Google ScholarGoogle Scholar
  10. 10 Ross, K. W., AND YAO, D. D.Optimal dynamic scheduling in Jackson networks. IEEE Aurora. Contr. 34 (1989) 47-53.Google ScholarGoogle Scholar
  11. 11 TANTAW~, A. N., AND TOWSLEY, D. A general model for optimal static toad balancing in star network configurattons. In Performance "84. 1984, pp. 277-291. Google ScholarGoogle Scholar
  12. 12 TANTAWr, A. N., AND TOWSt, EY, D. Optimal static load batancmg in distributed computer systems. J. ACM, 32, 2 (Apr. t985), 445-465. Google ScholarGoogle Scholar
  13. 13 WELSh, D. Matroid Theory. Academic Press, London, 1976.Google ScholarGoogle Scholar
  14. 14 ZHOU, S. A trace-driven simulation study of dynamic load balancing. IEEE Trans. Softw. Eng. 14 (1988) 1327-1341. Google ScholarGoogle Scholar

Index Terms

  1. Optimal load balancing and scheduling in a distributed computer system

              Recommendations

              Comments

              Login options

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

              Sign in

              Full Access

              • Published in

                cover image Journal of the ACM
                Journal of the ACM  Volume 38, Issue 3
                July 1991
                259 pages
                ISSN:0004-5411
                EISSN:1557-735X
                DOI:10.1145/116825
                Issue’s Table of Contents

                Copyright © 1991 ACM

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 July 1991
                Published in jacm Volume 38, Issue 3

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader