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.
|Number of pages||9|
|Publication status||Published - 15 Jul 1998|
- Adaptive scheduling
- Dynamic quota
- Pre-emptive scheduling
ASJC Scopus subject areas
- Computer Networks and Communications