Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
- 3.
A task system has harmonic rates if and only if the periods of its tasks are pairwise divisible (for each i, j one has \(p_i|p_j\) or \(p_j|p_i\)) with no remainder.
References
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)
Burns, A.: An EDF runtime profile based on Ravenscar. Ada Lett XXXII(1), 24–31 (2013)
Burns, A.: The Ravenscar profile ACM. Ada Lett. XIX(4), 49–52 (1999)
Burns, A., Dobbing, B., Romanski, G.: The Ravenscar tasking profile for high integrity real-time programs. In: Asplund, L. (ed.) Ada-Europe 1998. LNCS, vol. 1411, pp. 263–275. Springer, Heidelberg (1998). doi:10.1007/BFb0055011
Burns, A., Wellings, A.: The deadline floor protocol and Ada. ACM SIGAda Ada Lett. 36(1), 29–34 (2016)
Liu, L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 20(1), 46–61 (1973)
Buttazzo, G.: Rate monotonic vs EDF: judgment day. Real Time Syst. 29, 5–26 (2005)
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)
Sha, L., Rajkumar, R., Lehoczky, J.: Priority inheritance protocols: an approach to real-time synchronisation. IEEE Trans. Comput. 39, 1175–1185 (1990)
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
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 2009
Vardanega, T., Zamorano, J., De La Puente, A.J.: On the dynamic semantics and the timing behavior of Ravenscar kernels. Real Time Syst. 29, 59–89 (2005)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Carletto, P., Vardanega, T. (2017). Ravenscar-EDF: Comparative Benchmarking of an EDF Variant of a Ravenscar Runtime. In: Blieberger, J., Bader, M. (eds) Reliable Software Technologies – Ada-Europe 2017. Ada-Europe 2017. Lecture Notes in Computer Science(), vol 10300. Springer, Cham. https://doi.org/10.1007/978-3-319-60588-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-60588-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60587-6
Online ISBN: 978-3-319-60588-3
eBook Packages: Computer ScienceComputer Science (R0)