A priority ceiling protocol for multiple-instance resources

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.<
>