Abstract
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.
- Baker T.P., "Stack-Based Scheduling of Realtime Processes", Journal of Real-Time Systems, Volume 3, Issue 1 (March 1991), pp. 67--99. Google Scholar
Digital Library
- L. Sha, R. Rajkumar, and J.P. Lehoczky. "Priority inheritance protocols: An approach to real-time synchronisation". IEEE Transactions on Computers, 39(9):1175--1185, 1990. Google Scholar
Digital Library
- A. Burns. "A Deadline-Floor Inheritance Protocol for EDF Scheduled Real-Time Systems with Resource Sharing". Technical Report YCS-2012-476, Department of Computer Science, University of York, UK, 2012.Google Scholar
- A. Zerzelidis, A. Burns, A. J. Wellings. "Correcting the EDF protocol in Ada 2005". ACM Ada Letters -- IRTAW '07: Proceedings of the 13th international workshop on Real-time Ada, 2007. Google Scholar
Digital Library
- M.L. Fairbairn and A. Burns. "Implementing and Verifying EDF Preemption-Level Resource Control". LNCS 7308 -- Proceedings Reliable Software Technology - Ada-Europe, Springer, 2012. Google Scholar
Digital Library
- M. Aldea and M. González. "MaRTE OS: An Ada Kernel for Real-Time Embedded Applications". Proceedings of the International Conference on Reliable Software Technologies, Ada-Europe-2001, Leuven, Belgium, Lecture Notes in Computer Science, LNCS 2043, May, 2001. Google Scholar
Digital Library
- MaRTE OS home page: http://marte.unican.esGoogle Scholar
- M. Aldea, M. González and J.F. Ruiz. "Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT". LNCS 5570 -- Proceedings of the Reliable Software Technologies - Ada-Europe, Springer, 2009. Google Scholar
Digital Library
- M. Gutiérrez López, A. Burns, M. Aldea Rivas, M. González Harbour. "Performance comparison between the SRP and DFP synchronization protocols in MaRTE OS". Technical Report. University of Cantabria. Jan, 2013. URI: http://hdl.handle.net/10902/1509Google Scholar
- Michael T. Goodrich, Roberto Tamassia. "Data Structures & Algorithms in Java", John Wiley & Sons, Inc, 2006, pages 320--321. Google Scholar
Digital Library
Recommendations
Secure Protocol Transformations
Proceedings, Part II, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9815In the rich literature of secure multi-party computation MPC, several important results rely on "protocol transformations," whereby protocols from one model of MPC are transformed to protocols from another model. Motivated by the goal of simplifying and ...
Preemptive Hadoop Jobs Scheduling under a Deadline
SKG '12: Proceedings of the 2012 Eighth International Conference on Semantics, Knowledge and GridsMapReduce has become the dominant programming model in a cloud-based data processing environment, such as Hadoop. First In First Out (FIFO) is the default job scheduling policy of Hadoop, but it cannot guarantee that the job will be completed by a ...
A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing
Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. For realistic programs, tasks must be allowed to exchange data and use other forms of resources that must be accessed under ...






Comments