Skip to main content

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 286))

  • 64 Accesses

Abstract

To assign jobs to servers in a distributed system, at least two decisions must be made in general. One decision is to select a suitable server for the respective job which is related to the aspect of load sharing. From the servers view there is a corresponding decision to select the next job to be served, which addresses the problem of fairness. It is the goal of this paper to study how to make this second decision in order to assign servers to clients in a fair way. A general fairness criterion is introduced and applied to different algorithms, which are tested analytically and by simulation. It turns out that assignment by consumption dependent priorities gives the best results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. L. Black. Scheduling support for concurrency and parallelism in the Mach operating system. Computer (5, 1990), 35–43.

    Google Scholar 

  2. A. Demcrs, S. Kcshav, S. Shcnker. Analysis and simulation of a fair queueing algorithm. SIGCOMM ’89 Symposium Communications Architectures and Protocols (1989).

    Google Scholar 

  3. N. Franccz.Fairness. Texts and monographs in computer science, Springer-Verlag (1986).

    Google Scholar 

  4. K. Geihs.The road to open distributed computing (ODP). GI/ITG KIVS ’91 Proceedings, Springer-Verlag (1991), 43–52.

    Google Scholar 

  5. M. Gcrla, H.W. Chan, J.R.B. de Marca. Fairness in computer networks. IEEE International Conf. on Communications (1985), 1384–1389.

    Google Scholar 

  6. W. Gora, I. Weigel.Lastverteilung in heterogenen Netzen am Beispiel einer rechnerintegrierten Fertigung. GI/ITG KIVS ’89 Proc., Springer-Verlag (1989), 352–369.

    Google Scholar 

  7. S. Haldar, D.K. Subramanian. Fairness in processor scheduling in time sharing systems. ACM Operating Systems Review Vol. 25 No. 1 (1991), 4–18.

    Article  Google Scholar 

  8. J.M. Jaffe.Bottleneck flow control IEEE Trans. Commun. Vol. COM-28 (1981), 954–962.

    Article  MathSciNet  Google Scholar 

  9. M.J. Karol, S.C. Schwartz.Multiple access protocols: Fairness in heterogeneous systems. IEEE INFOCOM ’85 Proceedings (1985), 151–160

    Google Scholar 

  10. J. Kay, P. Lauder. A Fair Share Scheduler. Commun. ACM 31 1 (1988), 44–55.

    Article  Google Scholar 

  11. L. Kleinrock.Queueing Systems, Vol.11 Computer Applications. Wiley (1976)

    Google Scholar 

  12. P. Krueger, M. Livny.The Diverse Objectives of Distributed Scheduling Policies. Proceedings of the 7. IEEE Distributed Computing Conference (1987), 242–249.

    Google Scholar 

  13. M. Mähler, K. Gcilis. A note on load sharing versus fairness. Accepted by GI/ITG MMB ’91, Munich (1991).

    Google Scholar 

  14. M.W. Mutka, M. Livny.Scheduling Remote Processing Capacity In A Workstation- Processor Bank Network. Proc. of the 7. IEEE Distributed Computing Conf. (1987), 2–9.

    Google Scholar 

  15. Open System Foundation. OSF chooses the technologies for its distributed computing environment. OSN-The Open Systems Newsletter, Technology Appraisals Ltd., June, 1990, 1–8.

    Google Scholar 

  16. C.H. Sauer, E.A. MacNair, J. F. Kurose.The Research Queueing Package. IBM Research Report RA-138 Yorktown Heights (1982).

    Google Scholar 

  17. H. Schmutz, H. Eberle, K.F. Finkemeyer. Virtual Machine Dispatching under Fairness Constraints. Virtuelle Maschinen, IFB 18, Springer-Verlag (1979) 65–96

    Chapter  Google Scholar 

  18. M.M. Tlieimer, K.A.Lantz Finding Idle Machines in a Workstation-Based Distributed System. IEEE Trans. Software Eng. 15 11 (1989), 1444–1458

    Article  Google Scholar 

  19. Y.T. Wang, R.J.T. Morris.Load Sharing in Distributed Systems. IEEE Trans, Comput. 34 3 (1985), 204–217.

    Article  Google Scholar 

  20. J F. Wong, J.R.B. de Marca. Fairness in Window Flow Controlled Computer Networks. IEEE Trans. Commun. 37 5 (1989), 475–480

    Article  Google Scholar 

  21. A. Wolisz, V. Tscliammcr.Some performance aspects of trading service design. IEEE INFOCOM ’91 Proceedings (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mähler, M. (1991). Job Scheduling under Fairness Aspects. In: Lehmann, A., Lehmann, F. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte, vol 286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76934-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76934-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54550-7

  • Online ISBN: 978-3-642-76934-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics