Job Scheduling under Fairness Aspects
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.
KeywordsDistributed systems performance attributes scheduling load sharing fairness.
Unable to display preview. Download preview PDF.
- D. L. Black. Scheduling support for concurrency and parallelism in the Mach operating system. Computer (5, 1990), 35–43.Google Scholar
- A. Demcrs, S. Kcshav, S. Shcnker. Analysis and simulation of a fair queueing algorithm. SIGCOMM ’89 Symposium Communications Architectures and Protocols (1989).Google Scholar
- N. Franccz.Fairness. Texts and monographs in computer science, Springer-Verlag (1986).Google Scholar
- K. Geihs.The road to open distributed computing (ODP). GI/ITG KIVS ’91 Proceedings, Springer-Verlag (1991), 43–52.Google Scholar
- M. Gcrla, H.W. Chan, J.R.B. de Marca. Fairness in computer networks. IEEE International Conf. on Communications (1985), 1384–1389.Google Scholar
- 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
- M.J. Karol, S.C. Schwartz.Multiple access protocols: Fairness in heterogeneous systems. IEEE INFOCOM ’85 Proceedings (1985), 151–160Google Scholar
- L. Kleinrock.Queueing Systems, Vol.11 Computer Applications. Wiley (1976)Google Scholar
- P. Krueger, M. Livny.The Diverse Objectives of Distributed Scheduling Policies. Proceedings of the 7. IEEE Distributed Computing Conference (1987), 242–249.Google Scholar
- M. Mähler, K. Gcilis. A note on load sharing versus fairness. Accepted by GI/ITG MMB ’91, Munich (1991).Google Scholar
- 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
- 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
- C.H. Sauer, E.A. MacNair, J. F. Kurose.The Research Queueing Package. IBM Research Report RA-138 Yorktown Heights (1982).Google Scholar
- A. Wolisz, V. Tscliammcr.Some performance aspects of trading service design. IEEE INFOCOM ’91 Proceedings (1991)Google Scholar