Dual priority scheduling

R Davis; A Wellings

doi:10.1109/REAL.1995.495200

Dual priority scheduling

R Davis, A Wellings

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate. Offline methods of identifying spare capacity such as the Deferrable Server or Priority Exchange Algorithm are unable to make this spare capacity available as anything other than a background service opportunity for soft tasks. Further, more recent methods such as dynamic Slack Stealing require computationally expensive re-evaluation of the available slack in order to reclaim such spare capacity. By comparison, the Dual Priority approach presented in this paper provides an efficient and effective means of scheduling soft task in this case

Original language	English
Title of host publication	IEEE Real-Time Systems Symposium
Pages	100-109
Number of pages	10
DOIs	https://doi.org/10.1109/REAL.1995.495200
Publication status	Published - Dec 1995
Event	16th IEEE Real-Time Systems Symposium - PISA Duration: 5 Dec 1995 → 7 Dec 1995

Conference

Conference	16th IEEE Real-Time Systems Symposium
City	PISA
Period	5/12/95 → 7/12/95

Keywords

real-time
fixed priority
scheduling
dual priority

Access to Document

10.1109/REAL.1995.495200

Cite this

@inproceedings{70a922eee6634834bfebf06583b897db,

title = "Dual priority scheduling",

abstract = "In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate. Offline methods of identifying spare capacity such as the Deferrable Server or Priority Exchange Algorithm are unable to make this spare capacity available as anything other than a background service opportunity for soft tasks. Further, more recent methods such as dynamic Slack Stealing require computationally expensive re-evaluation of the available slack in order to reclaim such spare capacity. By comparison, the Dual Priority approach presented in this paper provides an efficient and effective means of scheduling soft task in this case",

keywords = "real-time, fixed priority, scheduling, dual priority",

author = "R Davis and A Wellings",

year = "1995",

month = dec,

doi = "10.1109/REAL.1995.495200",

language = "English",

isbn = "0-8186-7337-0 ",

pages = "100--109",

booktitle = "IEEE Real-Time Systems Symposium",

note = "16th IEEE Real-Time Systems Symposium ; Conference date: 05-12-1995 Through 07-12-1995",

}

TY - GEN

T1 - Dual priority scheduling

AU - Davis, R

AU - Wellings, A

PY - 1995/12

Y1 - 1995/12

N2 - In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate. Offline methods of identifying spare capacity such as the Deferrable Server or Priority Exchange Algorithm are unable to make this spare capacity available as anything other than a background service opportunity for soft tasks. Further, more recent methods such as dynamic Slack Stealing require computationally expensive re-evaluation of the available slack in order to reclaim such spare capacity. By comparison, the Dual Priority approach presented in this paper provides an efficient and effective means of scheduling soft task in this case

AB - In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate. Offline methods of identifying spare capacity such as the Deferrable Server or Priority Exchange Algorithm are unable to make this spare capacity available as anything other than a background service opportunity for soft tasks. Further, more recent methods such as dynamic Slack Stealing require computationally expensive re-evaluation of the available slack in order to reclaim such spare capacity. By comparison, the Dual Priority approach presented in this paper provides an efficient and effective means of scheduling soft task in this case

KW - real-time

KW - fixed priority

KW - scheduling

KW - dual priority

U2 - 10.1109/REAL.1995.495200

DO - 10.1109/REAL.1995.495200

M3 - Conference contribution

SN - 0-8186-7337-0

SP - 100

EP - 109

BT - IEEE Real-Time Systems Symposium

T2 - 16th IEEE Real-Time Systems Symposium

Y2 - 5 December 1995 through 7 December 1995

ER -