A Schedulability Compatible Multiprocessor Resource Sharing Protocol - MrsP

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Lock-based resource sharing protocols for single processor systems are well understood and supported in programming languages and in Real-Time Operating Systems. In contrast, multiprocessor resource sharing protocols are less well developed with no agreed best practice. In this paper we propose a new multiprocessor variant of a protocol based on the single processor priority ceiling protocol. The distinctive nature of the new protocol is that tasks waiting to gain access to a resource must service the resource on behalf of other tasks that are waiting for the same resource (but have been preempted). The form of the protocol is motivated by the desire to link the protocol with effective schedulability analysis. The protocol is general purpose, but is developed in this paper for partitioned fixed priority systems with the sporadic task model. Two methods of supporting the protocol are described, as is a prototype `proof of concept' implementation for one of these schemes.
Original languageEnglish
Title of host publicationProceedings - Euromicro Conference on Real-Time Systems
Number of pages10
Publication statusPublished - 15 Oct 2013
Event25th Euromicro Conference on Real-Time Systems, ECRTS 2013 - Paris, United Kingdom
Duration: 9 Jul 201312 Jul 2013


Conference25th Euromicro Conference on Real-Time Systems, ECRTS 2013
Country/TerritoryUnited Kingdom


  • locking protocols
  • mulltiprocessor systems
  • real-time systems

Cite this