Credit scheduling is a novel quota-based discipline to schedule a reso
urce among several requestors. It is characterized by a dynamic quota
which is a function of a requester's waiting time since its last servi
ce. The discipline combines characteristics of the processor sharing a
nd first-come-first-served disciplines and can provide improved respon
se time and fairness characteristics in several environments. We analy
ze open and closed system configurations using credit scheduling throu
gh simulations and approximate behaviour analysis. The results demonst
rate the advantages of the scheme in various applications. (C) 1998 El
sevier Science B.V.