Credit scheduling

Adaptive scheduling with dynamic service quota

Dimitrios N. Serpanos, Asser N. Tantawi, Ahmed N. Tantawy

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)889-897
Number of pages9
JournalComputer Communications
Volume21
Issue number10
Publication statusPublished - 15 Jul 1998
Externally publishedYes

Fingerprint

Scheduling

Keywords

  • Adaptive scheduling
  • Dynamic quota
  • Fairness
  • FCFS
  • Pre-emptive scheduling
  • Round-robin
  • Scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Serpanos, D. N., Tantawi, A. N., & Tantawy, A. N. (1998). Credit scheduling: Adaptive scheduling with dynamic service quota. Computer Communications, 21(10), 889-897.

Credit scheduling : Adaptive scheduling with dynamic service quota. / Serpanos, Dimitrios N.; Tantawi, Asser N.; Tantawy, Ahmed N.

In: Computer Communications, Vol. 21, No. 10, 15.07.1998, p. 889-897.

Research output: Contribution to journalArticle

Serpanos, DN, Tantawi, AN & Tantawy, AN 1998, 'Credit scheduling: Adaptive scheduling with dynamic service quota', Computer Communications, vol. 21, no. 10, pp. 889-897.
Serpanos DN, Tantawi AN, Tantawy AN. Credit scheduling: Adaptive scheduling with dynamic service quota. Computer Communications. 1998 Jul 15;21(10):889-897.
Serpanos, Dimitrios N. ; Tantawi, Asser N. ; Tantawy, Ahmed N. / Credit scheduling : Adaptive scheduling with dynamic service quota. In: Computer Communications. 1998 ; Vol. 21, No. 10. pp. 889-897.
@article{aefcac950fe7421b800840ca8ab7cdb0,
title = "Credit scheduling: Adaptive scheduling with dynamic service quota",
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.",
keywords = "Adaptive scheduling, Dynamic quota, Fairness, FCFS, Pre-emptive scheduling, Round-robin, Scheduling",
author = "Serpanos, {Dimitrios N.} and Tantawi, {Asser N.} and Tantawy, {Ahmed N.}",
year = "1998",
month = "7",
day = "15",
language = "English",
volume = "21",
pages = "889--897",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - Credit scheduling

T2 - Adaptive scheduling with dynamic service quota

AU - Serpanos, Dimitrios N.

AU - Tantawi, Asser N.

AU - Tantawy, Ahmed N.

PY - 1998/7/15

Y1 - 1998/7/15

N2 - 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.

AB - 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.

KW - Adaptive scheduling

KW - Dynamic quota

KW - Fairness

KW - FCFS

KW - Pre-emptive scheduling

KW - Round-robin

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0032124071&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032124071&partnerID=8YFLogxK

M3 - Article

VL - 21

SP - 889

EP - 897

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 10

ER -