A priority ceiling protocol for multiple-instance resources

Author

Chen, Min-Ih ; Lin, Kwei-Jay

Author_Institution

Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA

fYear

1991

fDate

4-6 Dec 1991

Firstpage

140

Lastpage

149

Abstract

A systematic optimization process for multiple-instance resource sharing in real-time systems is presented. The authors derive the schedulability condition for systems with such resources and present 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

Keywords

optimisation; real-time systems; resource allocation; scheduling; multi-instance priority ceiling protocol; multiple-instance resource sharing; optimal resource preallocation algorithm; real-time systems; resource pool; resource preallocation; schedulability condition; system model; systematic optimization process; worst-case blocking behavior; Access control; Access protocols; Computer science; Control systems; Delay; Processor scheduling; Real time systems; Resource management; Scheduling algorithm; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1991. Proceedings., Twelfth

Conference_Location

San Antonio, TX

Print_ISBN

0-8186-2450-7

Type

conf

DOI

10.1109/REAL.1991.160367

Filename

160367