Show simple item record

dc.contributor.authorYue, Kwok-Bun
dc.date.accessioned2019-10-04T19:55:32Z
dc.date.available2019-10-04T19:55:32Z
dc.date.issued1996-11
dc.identifier.citationYue, K., Davari, S. & Leibfried, T., Priority Ceiling Protocol in Ada, Proceedings of the Tri-Ada '96 Conference, November 1996en_US
dc.identifier.urihttps://hdl.handle.net/10657.1/1506
dc.description.abstractThe priority ceiling protocol (PCP) is an effective protocol for minimizing priority inversions in real-time scheduling. Priority inversion occurs when a high priority task is blocked by a low priority task, such as at a shared semaphore or a protected operation. PCP guarantees the absence of chained priority inversion or deadlock. The ceiling looking (CL) priority on protected objects of Ada-95 also has these properties but has some limitations. For example, tasks cannot suspend themselves inside a protected operation. PCP has no such restrictions. Thus, PCP is more appropriate for some real-time applications. PCP has not been implemented in any language, including Ada. A guideline for emulating PCP using Ada-83 exists but it lacks generality and flexibility. This paper discusses an implementation of PCP in Ada-95, the Ada-95 features that enable the implementation, the desigu of the implementation and some related issues.
dc.publisherProceedings of the Tri-Ada '96 Conferenceen_US
dc.titlePriority Ceiling Protocol in Adaen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record