Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Minimizing Memory Utilization of Real-Time Task Sets in Single and Multi-Processor Systems-on-a-Chip
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Fixed-Priority Scheduling of Periodic Tasks on Multiprocessor Systems
Fixed-Priority Scheduling of Periodic Tasks on Multiprocessor Systems
Measuring the Performance of Schedulability Tests
Real-Time Systems
LITMUS^RT: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A Flexible Real-Time Locking Protocol for Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Real-Time Synchronization on Multiprocessors: To Block or Not to Block, to Suspend or Spin?
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Coordinated Task Scheduling, Allocation and Synchronization on Multiprocessors
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Supporting Nested Locking in Multiprocessor Real-Time Systems
ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
Scheduling and locking in multiprocessor real-time operating systems
Scheduling and locking in multiprocessor real-time operating systems
| Hi-index | 0.00 |
The goal of this paper is to explore the design space of protocols for multiprocessor systems with static priority and partitioned scheduling. The design space is defined by a set of characteristics that can vary from one protocol to another. This exploration presents new protocols with different characteristics from existing ones. These new protocols are considered variations of the Multiprocessor Priority Ceiling Protocol (MPCP), but they can also be seen as variations of the Flexible Multiprocessor Locking Protocol (FMLP), since they include features common to both protocols. Schedulability tests are provided for these new variations and they are compared with the original versions of MPCP and FMLP. Such comparisons include an empirical comparison of schedulability and an overhead evaluation of a real implementation. Such comparisons show that these new variations are actually competitive in relation to the existing protocols.