Ravenscar-EDF: Comparative Benchmarking of an EDF Variant of a Ravenscar Runtime
Subsequent to the publication of the seminal work by Liu and Layland in 1973, researchers and practitioners alike started discussing which online scheduling algorithm was to be preferred between FPS and EDF. Results published in 2005 sustained the superiority of EDF, already proven in theory, also from an implementation perspective. With this work, we aim at digging deeper into the roots of those results. To this end, we took the first-ever instance of an Ada Ravenscar runtime, with its FPS scheduler, combined with its IPCP locking policy companion, and developed a variant of it that implements EDF scheduling coupled with DFP locking. In this manner, we were able to transparently attach those two runtime variants to a suite of synthetic benchmarks, which we used to perform an extensive quantitative comparison between those two runtimes, getting to the bottom of where one prevails on the other.
KeywordsRavenscar profile Earliest Deadline First Deadline Floor Protocol Analysis and development Performance comparison
- 1.Burns, A.: 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
- 8.Goossens, J., Macq, C.: Limitation of the hyperperiod in real-time periodic task set generation. In: Proceedings of the RTS Embedded System (RTS 2001), pp. 133–147 (2001)Google Scholar
- 10.Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.J.: Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J. 8(5), 284–292 (1993). doi: 10.1049/sej.1993.0034
- 11.Davis, R., Baruah, S., Rothvoss, T., Burns, A.: Quantifying the sub-optimality of uniprocessor fixed priority pre-emptive scheduling for sporadic tasksets with arbitrary deadlines. In: RTNS 2009, Paris, ECE, 26–27 October 2009Google Scholar