Resource sharing in global fixed-priority preemptive multiprocessor scheduling

Arvind Easwaran; Björn Andersson

doi:10.1109/RTSS.2009.37

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

Arvind Easwaran^*, Björn Andersson

^*Corresponding author for this work

Polytechnic Institute of Porto

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

69 Citations (Scopus)

Abstract

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

Original language	English
Title of host publication	Proceedings - Real-Time Systems Symposium, RTSS 2009
Pages	377-386
Number of pages	10
DOIs	https://doi.org/10.1109/RTSS.2009.37
Publication status	Published - 2009
Externally published	Yes
Event	Real-Time Systems Symposium, RTSS 2009 - Washington, D.C., United States Duration: Dec 1 2009 → Dec 4 2009

Publication series

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

Conference

Conference	Real-Time Systems Symposium, RTSS 2009
Country/Territory	United States
City	Washington, D.C.
Period	12/1/09 → 12/4/09

ASJC Scopus Subject Areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1109/RTSS.2009.37

Cite this

@inproceedings{16dbff5e1f2e4a33baae86bdc6a84fd8,

title = "Resource sharing in global fixed-priority preemptive multiprocessor scheduling",

abstract = "In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.",

author = "Arvind Easwaran and Bj{\"o}rn Andersson",

year = "2009",

doi = "10.1109/RTSS.2009.37",

language = "English",

isbn = "9780769538754",

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

pages = "377--386",

booktitle = "Proceedings - Real-Time Systems Symposium, RTSS 2009",

note = "Real-Time Systems Symposium, RTSS 2009 ; Conference date: 01-12-2009 Through 04-12-2009",

}

TY - GEN

T1 - Resource sharing in global fixed-priority preemptive multiprocessor scheduling

AU - Easwaran, Arvind

AU - Andersson, Björn

PY - 2009

Y1 - 2009

N2 - In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

AB - In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritance protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called reasonable priority-assignments.

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

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

U2 - 10.1109/RTSS.2009.37

DO - 10.1109/RTSS.2009.37

M3 - Conference contribution

AN - SCOPUS:77649326308

SN - 9780769538754

T3 - Proceedings - Real-Time Systems Symposium

SP - 377

EP - 386

BT - Proceedings - Real-Time Systems Symposium, RTSS 2009

T2 - Real-Time Systems Symposium, RTSS 2009

Y2 - 1 December 2009 through 4 December 2009

ER -

Resource sharing in global fixed-priority preemptive multiprocessor scheduling

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this