Stack-based scheduling for realtime processes
Real-Time Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Michael González Harbour: MaRTE OS: An Ada Kernel for Real-Time Embedded Applications
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
Correcting the EDF protocol in Ada 2005
IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Implementing and verifying EDF preemption-level resource control
Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
| Hi-index | 0.00 |
The Ada 2005 standard introduced "Earliest Deadline First" (EDF) as one of the supported dispatching policies. The standard specifies the "Stack Resource Protocol" (SRP) as the protocol for resource sharing among EDF tasks. During the time the SRP has been in the standard it has shown to be a relatively complex protocol. Recently, a new protocol has been proposed for resource sharing in EDF. This new protocol, called "Deadline Floor inheritance Protocol" (DFP), is simpler and more efficient than SRP while keeping all its good properties. In this paper we briefly describe both protocols and compare them from the complexity point of view. In light of its simplicity, we propose to change the language standard to include DFP instead of SRP. Some alternative modifications of the Ada Reference Manual are pointed out in order to include DFP in the most straightforward way.