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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. L. Black. Scheduling support for concurrency and parallelism in the Mach operating system. Computer (5, 1990), 35–43.
A. Demcrs, S. Kcshav, S. Shcnker. Analysis and simulation of a fair queueing algorithm. SIGCOMM ’89 Symposium Communications Architectures and Protocols (1989).
N. Franccz.Fairness. Texts and monographs in computer science, Springer-Verlag (1986).
K. Geihs.The road to open distributed computing (ODP). GI/ITG KIVS ’91 Proceedings, Springer-Verlag (1991), 43–52.
M. Gcrla, H.W. Chan, J.R.B. de Marca. Fairness in computer networks. IEEE International Conf. on Communications (1985), 1384–1389.
W. Gora, I. Weigel.Lastverteilung in heterogenen Netzen am Beispiel einer rechnerintegrierten Fertigung. GI/ITG KIVS ’89 Proc., Springer-Verlag (1989), 352–369.
S. Haldar, D.K. Subramanian. Fairness in processor scheduling in time sharing systems. ACM Operating Systems Review Vol. 25 No. 1 (1991), 4–18.
J.M. Jaffe.Bottleneck flow control IEEE Trans. Commun. Vol. COM-28 (1981), 954–962.
M.J. Karol, S.C. Schwartz.Multiple access protocols: Fairness in heterogeneous systems. IEEE INFOCOM ’85 Proceedings (1985), 151–160
J. Kay, P. Lauder. A Fair Share Scheduler. Commun. ACM 31 1 (1988), 44–55.
L. Kleinrock.Queueing Systems, Vol.11 Computer Applications. Wiley (1976)
P. Krueger, M. Livny.The Diverse Objectives of Distributed Scheduling Policies. Proceedings of the 7. IEEE Distributed Computing Conference (1987), 242–249.
M. Mähler, K. Gcilis. A note on load sharing versus fairness. Accepted by GI/ITG MMB ’91, Munich (1991).
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.
Open System Foundation. OSF chooses the technologies for its distributed computing environment. OSN-The Open Systems Newsletter, Technology Appraisals Ltd., June, 1990, 1–8.
C.H. Sauer, E.A. MacNair, J. F. Kurose.The Research Queueing Package. IBM Research Report RA-138 Yorktown Heights (1982).
H. Schmutz, H. Eberle, K.F. Finkemeyer. Virtual Machine Dispatching under Fairness Constraints. Virtuelle Maschinen, IFB 18, Springer-Verlag (1979) 65–96
M.M. Tlieimer, K.A.Lantz Finding Idle Machines in a Workstation-Based Distributed System. IEEE Trans. Software Eng. 15 11 (1989), 1444–1458
Y.T. Wang, R.J.T. Morris.Load Sharing in Distributed Systems. IEEE Trans, Comput. 34 3 (1985), 204–217.
J F. Wong, J.R.B. de Marca. Fairness in Window Flow Controlled Computer Networks. IEEE Trans. Commun. 37 5 (1989), 475–480
A. Wolisz, V. Tscliammcr.Some performance aspects of trading service design. IEEE INFOCOM ’91 Proceedings (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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