Ada-Europe 2009: Reliable Software Technologies – Ada-Europe 2009 pp 119-133 | Cite as
Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005
Conference paper
Abstract
Earliest Deadline First (EDF) and Fixed Priority (FP) scheduling represent the two main dispatching policies within the research domain of real-time systems engineering. Both dispatching policies are now supported by Ada. In this paper the two approaches are combined to maximize the advantages of both schemes. From EDF comes efficiency, from FP predictability. A system model is presented in which a relatively small number of high-integrity tasks are scheduled by FP, with the rest of the tasks being handled via an EDF domain of lower priority. Two aspects of integration are covered in this paper. Firstly, Response-Time Analysis (for FP) and Processor-Demand Analysis (for EDF) are brought together to provide a single analysis framework. Secondly, the programming of systems which combine FP and EDF is addressed within the facilities provided by Ada 2005. Both partitioned and dynamic schemes are covered.
Keywords
Earliest Deadline First Sporadic Task Schedulability Analysis Preemptive Schedule Schedulability Test
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Audsley, N.C., Burns, A., Richardson, M., Tindell, K., Wellings, A.J.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8(5), 284–292 (1993)CrossRefGoogle Scholar
- 2.Baker, T.P.: Stack-based scheduling of realtime processes. Real-Time Systems 3(1) (March 1991)Google Scholar
- 3.Baruah, S.K., Burns, A.: Sustainable schedulability analysis. In: IEEE Real-Time Systems Symposium (RTSS), pp. 159–168 (2006)Google Scholar
- 4.Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility problems for recurring tasks on one processor. Theorectical Computer Science 118, 3–20 (1993)MathSciNetCrossRefMATHGoogle Scholar
- 5.Baruah, S.K., Mok, A.K., Rosier, L.E.: Preemptive scheduling of hard real-time sporadic tasks on one processor. In: IEEE Real-Time Systems Symposium (RTSS), pp. 182–190 (1990)Google Scholar
- 6.Baruah, S.K., Mok, A.K., Rosier, L.E.: Hybrid-priority scheduling of resource-sharing sporadic task systems. In: IEEE Real-Time Systems and Applications Symposium, RTAS (2008)Google Scholar
- 7.Bernat, G., Burns, A.: Combining (n m)-hard deadlines with dual priority scheduling. In: Proceedings 18th IEEE Real-Time Systems Symposium, pp. 46–57 (1997)Google Scholar
- 8.Bril, R.J., Verhaegh, W.F.J., Pol, E.-J.D.: Initial values for on-line response time calculations. In: Proceedings of the 15th Euromicro Conference on Real-Time Systems (ECRTS), pp. 13–22 (2003)Google Scholar
- 9.Brukardt, R. (ed.): Ada 2005 reference manual. Technical report, ISO (2006)Google Scholar
- 10.Burns, A., Wellings, A.J.: Concurrency and Real-Time Programming in Ada 2005. Cambridge University Press, Cambridge (2007)CrossRefMATHGoogle Scholar
- 11.Burns, A., Wellings, A.J.: Real-Time Systems and Programming Languages, 4th edn. Addison-Wesley Longman, Amsterdam (2009)MATHGoogle Scholar
- 12.Buttazzo, G.: Rate monotonic vs. EDF: Judgement day. Real-Time Systems Journal 29(1), 5–26 (2005)CrossRefMATHGoogle Scholar
- 13.Davis, R.I., Wellings, A.J.: Dual priority scheduling. In: Proceedings 16th IEEE Real-Time Systems Symposium, pp. 100–109 (1995)Google Scholar
- 14.Davis, R.I., Zabos, A., Burns, A.: Efficient exact schedulability tests for fixed priority pre-emptive systems. IEEE Transaction on Computers 57(9), 1261–1276 (2008)MathSciNetCrossRefGoogle Scholar
- 15.Harbour, M.G., Gutirrez, J.C.P.: Response time analysis for tasks scheduled under EDF within fixed priorities. In: IEEE Real-Time Systems Symposium (RTSS), pp. 200–209 (2003)Google Scholar
- 16.Joseph, M., Pandya, P.: Finding response times in a real-time system. BCS Computer Journal 29(5), 390–395 (1986)MathSciNetCrossRefGoogle Scholar
- 17.Lehoczky, J.P., Sha, L., Strosnider, J.K.: Enhanced aperiodic responsiveness in a hard real-time environment. In: Proceedings 8th IEEE Real-Time Systems Symposium, pp. 261–270 (1987)Google Scholar
- 18.Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands) 2(4), 237–250 (1982)MathSciNetCrossRefMATHGoogle Scholar
- 19.Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 20(1), 46–61 (1973)MathSciNetCrossRefMATHGoogle Scholar
- 20.Ripoll, I., Mok, A.K.: Improvement in feasibilty testing for real-time tasks. Journal of Real-Time Systems 11(1), 19–39 (1996)CrossRefGoogle Scholar
- 21.Sprunt, B., Sha, L., Lehoczky, J.P.: Aperiodic task scheduling for hard real-time systems. Real-Time Systems 1, 27–69 (1989)CrossRefGoogle Scholar
- 22.Spuri, M.: Analysis of deadline schedule real-time systems. Technical Report 2772, INRIA, France (1996)Google Scholar
- 23.Zhang, F., Burns, A.: Analysis of hierarchical EDF preemptive scheduling. In: IEEE Real-Time Systems Symposium (RTSS), pp. 423–435 (2007)Google Scholar
- 24.Zhang, F., Burns, A.: Schedulability analysis for real-time systems with EDF scheduling. Technical Report YCS 426, University of York (2008)Google Scholar
- 25.Zhang, F., Burns, A.: Schedulability analysis for real-time systems with EDF scheduling. IEEE Transaction on Computers (to appear) (2008)Google Scholar
- 26.Zuberi, K.M., Pillai, P., Shin, K.G., Emeralds, K.G.: A small memory real-time microkernel. In: ACM Symposium on Operating Systems Principles, pp. 277–291 (1999)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2009