Credit scheduling: adaptive scheduling with dynamic service quota

Credit scheduling is a novel quota-based discipline to schedule a resource among several requestors. It is characterized by a dynamic quota which is a function of a requestor's waiting time since its last service. The discipline combines characteristics of the processor sharing and first-come-first-served disciplines and can provide improved response time and fairness characteristics in several environments. We analyze open and closed system configurations using credit scheduling through simulations and approximate behaviour analysis. The results demonstrate the advantages of the scheme in various applications.

[1]  Samuel J. Leffler,et al.  The design and implementation of the 4.3 BSD Unix operating system , 1991, Addison-Wesley series in computer science.

[2]  Manfred Ruschitzka.  Policy function scheduling , 1981, Perform. Evaluation.

[3]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[4]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[5]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[6]  Asser N. Tantawi,et al.  An adaptive scheduling scheme for dynamic service time allocation on a shared resource , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[7]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[8]  Harvey M. Deitel,et al.  An introduction to operating systems , 1984 .