Abstract
Fixed-priority schedulers received a lot of attention from the real-time community, and a big effort has been performed to develop accurate and more general schedulability analysis that can ensure the correct execution of the system. Nevertheless, only few works analysed the overhead and blocking intervals introduced by the scheduler and the associated kernel routines, modifying the schedulability tests to take into account these overheads. However, all these works assume a very simple scheduler that uses trivial data structures to stores the tasks information. This work analyses data structures used in several open real-time kernels that supports Ada language. Additionally, a new data structure, the Cartesian trees, is proposed. As a conclusion, the preliminary studies show that alternative data structures, as proposed Cartesian trees, can improve the scalability of the system strongly reducing the scheduling overheads.
This work is partially supported by European Project IST-35102.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM XXI, 40–61 (1973)
Joseph, M., Pandya, P.: Finding response times in real-time systems. The Computer Journal 29, 390–395 (1986)
Lehoczky, J., Sha, L., Ding, Y.: The rate-monotonic scheduling algorithm: Exact characterization and average behavior. In: Proceedings of the Real-Time Systems Symposium, pp. 166–171 (1989)
Audsley, N., Burns, A., David, R., Tindell, K., Wellings, A.: Fixed priority pre-emptive scheduling: An historical prespective. Real-Time Systems 8, 173–189 (1995)
POSIX.13: IEEE Std. 1003.13-1998. Information Technology -Standardized Application Environment Profile- POSIX Realtime Application Support (AEP). The Institute of Electrical and Electronics Engineers (1998)
Katcher, D., Arakawa, H., Strosnider, J.: Engineering and analysis of fixed priority schedulers. IEEE Transactions on Software Engineering 19, 920–934 (1993)
Jeffay, K., Stone, D.L.: Accounting for interrupt handling costs in dynamic priority task systems. In: Proceedings of Real-Time Systems Symposium, pp. 212–221 (1993)
Burns, A., Tindell, K., Wellings, A.: Effective analysis for engineering real-time fixed priority schedulers. IEEE Transactions on Software Engineering 21, 475–480 (1995)
Barabanov, M.: A Linux-based real time operating system. Master’s thesis, New Mexico Institute of Mining and Technology (1997)
Puente, J., Zamorano, J., Ruiz, J.F., Fernández, R., García, R.: The design and implementation of the Open Ravenscar Kernel. ACM SIGAda Ada Letters XXI, 85–90 (2001)
Aldea Rivas, M., González Harbour, M.: MaRTE OS: An ada kernel for real-time embedded applications. In: Strohmeier, A., Craeynest, D. (eds.) Ada-Europe 2001. LNCS, vol. 2043, p. 305. Springer, Heidelberg (2001)
McGuire, N.: A sorted queue scheduler for RTLinux/GPL(Personal communication)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sáez, S., Lorente, V., Terrasa, S., Crespo, A. (2005). Efficient Alternatives for Implementing Fixed-Priority Schedulers. In: Vardanega, T., Wellings, A. (eds) Reliable Software Technology – Ada-Europe 2005. Ada-Europe 2005. Lecture Notes in Computer Science, vol 3555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499909_4
Download citation
DOI: https://doi.org/10.1007/11499909_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26286-2
Online ISBN: 978-3-540-31666-4
eBook Packages: Computer ScienceComputer Science (R0)