Resource sharing in EDF-scheduled systems: A closer look

Sanjoy K. Baruah

doi:10.1109/RTSS.2006.41

Resource sharing in EDF-scheduled systems: A closer look

Sanjoy K. Baruah

Department of Computer Science & Engineering

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

60 Scopus citations

Abstract

Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The Stack Resource Policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times.

Original language	English
Title of host publication	Proceedings of 27th IEEE International Real-Time Systems Symposium, RTSS 2006
Pages	379-387
Number of pages	9
DOIs	https://doi.org/10.1109/RTSS.2006.41
State	Published - 2006
Event	27th IEEE International Real-Time Systems Symposium, RTSS 2006 - Rio de Janeiro, Brazil Duration: Dec 5 2006 → Dec 8 2006

Publication series

Name	Proceedings - Real-Time Systems Symposium
ISSN (Print)	1052-8725

Conference

Conference	27th IEEE International Real-Time Systems Symposium, RTSS 2006
Country/Territory	Brazil
City	Rio de Janeiro
Period	12/5/06 → 12/8/06

Keywords

Earliest deadline first
Feasibility analysis
Resource replication
Stack resource policy

Access to Document

10.1109/RTSS.2006.41

Cite this

@inproceedings{406013959c1c40a58c511eb9d8911409,

title = "Resource sharing in EDF-scheduled systems: A closer look",

abstract = "Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The Stack Resource Policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times.",

keywords = "Earliest deadline first, Feasibility analysis, Resource replication, Stack resource policy",

author = "Baruah, \{Sanjoy K.\}",

year = "2006",

doi = "10.1109/RTSS.2006.41",

language = "English",

isbn = "0769527612",

series = "Proceedings - Real-Time Systems Symposium",

pages = "379--387",

booktitle = "Proceedings of 27th IEEE International Real-Time Systems Symposium, RTSS 2006",

note = "27th IEEE International Real-Time Systems Symposium, RTSS 2006 ; Conference date: 05-12-2006 Through 08-12-2006",

}

TY - GEN

T1 - Resource sharing in EDF-scheduled systems

T2 - 27th IEEE International Real-Time Systems Symposium, RTSS 2006

AU - Baruah, Sanjoy K.

PY - 2006

Y1 - 2006

N2 - Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The Stack Resource Policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times.

AB - Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The Stack Resource Policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times.

KW - Earliest deadline first

KW - Feasibility analysis

KW - Resource replication

KW - Stack resource policy

UR - https://www.scopus.com/pages/publications/38949143955

U2 - 10.1109/RTSS.2006.41

DO - 10.1109/RTSS.2006.41

M3 - Conference contribution

AN - SCOPUS:38949143955

SN - 0769527612

SN - 9780769527611

T3 - Proceedings - Real-Time Systems Symposium

SP - 379

EP - 387

BT - Proceedings of 27th IEEE International Real-Time Systems Symposium, RTSS 2006

Y2 - 5 December 2006 through 8 December 2006

ER -

Resource sharing in EDF-scheduled systems: A closer look

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this