Credit scheduling: adaptive scheduling with dynamic service quota

Authors:
Dimitrios N. Serpanos;Asser N. Tantawi;Ahmed N. Tantawy
Affiliations:
IBM Research Division, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, USA;IBM Research Division, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, USA;IBM Research Division, T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, USA
Venue:
Computer Communications
Year:
1998

Citing 4
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
How fair is fair queuing

Journal of the ACM (JACM)
An Introduction to Operating Systems

An Introduction to Operating Systems
Computer Performance Modeling Handbook

Computer Performance Modeling Handbook

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.