A priority ceiling protocol for multiple-instance resources

Min Ih Chen*, Kwei Jay Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

The authors provide a systematic optimization process for multiple-instance resource sharing in real-time systems. They derive the schedulability condition for systems with such resources and presented an algorithm which can be used to divide a resource pool into smaller groups in order to improve the worst-case blocking behavior. They present the system model used and review some related work. The multi-instance priority ceiling protocol and its properties are discussed, the effect of resource preallocation on the schedulability of a system is studied, and an optimal resource preallocation algorithm is presented.

Original languageEnglish
Title of host publicationProceedings - Real-Time Systems Symposium
PublisherPubl by IEEE
Pages140-149
Number of pages10
ISBN (Print)0818624507
StatePublished - 1991
Externally publishedYes
EventProceedings of the 12th Real-Time Systems Symposium - San Antonio, TX, USA
Duration: 04 12 199106 12 1991

Publication series

NameProceedings - Real-Time Systems Symposium

Conference

ConferenceProceedings of the 12th Real-Time Systems Symposium
CitySan Antonio, TX, USA
Period04/12/9106/12/91

Fingerprint

Dive into the research topics of 'A priority ceiling protocol for multiple-instance resources'. Together they form a unique fingerprint.

Cite this