Abstract
This paper presents a definition of a Ravenscar-like profile (EDF Ravenscar) that incorporates EDF scheduling. Rather than just replace the dispatching policy, an argument is made for simplifying the support that is provided in full Ada for controlling access to protected objects. As a result all tasks and protected objects have their default priorities, and only one ready queue is needed (ordered by absolute deadline). The paper also outlines the static scheduling analysis that can be applied to applications conforming to the profile.
- T.P. Baker. Stack-based scheduling of realtime processes. Journal of Real-Time Systems, 3(1), March 1991. Google Scholar
Digital Library
- S.K. Baruah. Resource sharing in EDF-scheduled systems: A closer look. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 379--387, 2006. Google Scholar
Digital Library
- S.K. Baruah, R.R. Howell, and L.E. Rosier. Feasibility problems for recurring tasks on one processor. Theorectical Computer Science, 118:3--20, 1993. Google Scholar
Digital Library
- S.K. Baruah, A.K. Mok, and L.E. Rosier. Preemptive scheduling of hard real-time sporadic tasks on one processor. In Proceedings of IEEE Real-Time Systems Symposium (RTSS), pages 182--190, 1990.Google Scholar
- A. Burns. The Ravenscar Profile. ACM Ada Letters, XIX(4):49--52, Dec 1999. Google Scholar
Digital Library
- A. Burns, B. Dobbing, and G. Romanski. The Ravenscar tasking profile for high integrity real-time programs. In Reliable Software Technologies, Proceedings of the Ada Europe Conference, Uppsala, pages 263--275. Springer Verlag, 1998. Google Scholar
Digital Library
- A. Burns and A. J.Wellings. Real-Time Systems and Programming Languages. AddisonWesley Longman, 4th edition, 2009. Google Scholar
Digital Library
- I. Ripoll A. Crespo and A.K. Mok. Improvement in feasibilty testing for real-time tasks. Journal of Real-Time Systems, 11(1):19--39, 1996. Google Scholar
Digital Library
- R.I. Davis, T. Rothvo, S. . Baruah, and A. Burns. Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Journal of Real Time Systems, 43(3):211--258, Nov 2009. Google Scholar
Digital Library
- H. Hoang, G.C. Buttazzo, M. Jonsson, and S. Karlsson. Computing the minimum EDF feasible deadline in periodic systems. In RTCSA, pages 125--134, 2006. Google Scholar
Digital Library
- ISO/IEC. Information technology - programming languages - guide for the use of the Ada Ravenscar Profile in high integrity systems. Technical Report TR 24718, ISO/IEC, 2005.Google Scholar
- M. Kamrad and B. Spinney. An Ada runtime system implementation of the Ravenscar profile for high speed applicationlayer data switch. In Reliable Software Technologies, Proceedings of the Ada Europe Conference, Santander, pages 26--38. Springer Verlag, 1999. Google Scholar
Digital Library
- C.L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. JACM, 20(1):46--61, 1973. Google Scholar
Digital Library
- K. Lundqvist, L. Asplund, and S. Michell. A formal model of the Ada Ravenscar tasking profile; protected objects. In Reliable Software Technologies, Proceedings of the Ada Europe Conference, Santander, pages 12--25. Springer Verlag, 1999. Google Scholar
Digital Library
- M. Spuri. Analysis of deadline schedule real-time systems. Technical Report 2772, INRIA, France, 1996.Google Scholar
- A. Zerzelidis, A. Burns, and A.J. Wellings. Correcting the EDF protocol in Ada 2005. In Proceedings of IRTAW 13, Ada Letters, XXVII(2), pages 18--22, 2007. Google Scholar
Digital Library
- F. Zhang and A. Burns. Schedulability analysis for real-time systems with EDF scheduling. IEEE Transaction on Computers, 58(9):1250--1258, 2008. Google Scholar
Digital Library
- F. Zhang and A. Burns. Improvement to quick processor-demand analysis for EDF-scheduled real-time systems. In Proceedings of the 21st Euromicro Conference on Real-Time Systems (ECRTS), pages 76--86, 2009. Google Scholar
Digital Library
- F. Zhang, A. Burns, and S.K. Baruah. Sensitivity analysis for EDF scheduled arbitrary deadline real-time systems. In Proceedings of 16th IEEE Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 61--70, 2010. Google Scholar
Digital Library
Index Terms
An EDF run-time profile based on ravenscar
Recommendations
Global EDF-based scheduling with laxity-driven priority promotion
This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...
Global EDF-Based Scheduling with Efficient Priority Promotion
RTCSA '08: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and ApplicationsThis paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that ...
A Ravenscar-Compliant Run-time Kernel for Safety-Critical Systems*
The Ravenscar tasking profile for Ada 95 has been designed to allow implementation of highly safety critical systems. Ravenscar defines a tasking system with deterministic behavior and low complexity. We provide a formal model using UPPAAL of the ...






Comments