Abstract
Real-time scheduling on multiprocessor involves many complex issues. One of them is tie-breaking: the way how ties are broken among tasks with same priority. Unlike on uniprocessor, the feasibility of a task set on multiprocessor depends on a tie-breaking policy as well as on a scheduling algorithm. In this paper, we suggest and compare several tie-breaking policies for deadline-based schedule algorithms on multiprocessor. An effective tie-breaking policy for different scheduling algorithm is identified by simulation.
This work is supported in part by Brain Korea 21 project and in part by ICT.
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
Preview
Unable to display preview. Download preview PDF.
References
Goossens, J., Devillers, R., Funk, S.: Tie-Breaking for EDF on Multiprocessor Platforms. In: The 23rd IEEE International Real-Time Systems Symposium (2002)
Goossens, J., Funk, S., Baruah, S.K.: Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors. Real-Time Systems 25, 187–205 (2003)
Liu, C., Layland, J.: Scheduling Algorithms for Multiprogramming in a Hard Real- Time Environment. Journal of ACM 20, 46–61 (1973)
Baruah, S.K.: Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors. IEEE Trans. on Computers 53, 781–784 (2004)
Ernst, R.: Codesign of Embedded Systems. IEEE Design and Test of Computers 15, 45–54 (1998)
Audsley, N.: Towards the Codesign of Large Complex Hard Real-Time Embedded Systems. In: Proceedings Euromicro Workshop on Co-design for Embedded Real-Time Systems (2003)
Audsley, N.C., Burns, A., Richardson, M., Wellings, A.: Hard Real-Time Scheduling: The Deadline Monotonic Approach. In: Proceedings of IEEE Workshop on Real-Time Operating Systems and Software, pp. 133–137 (1991)
Cho, S., Lee, S., Ahn, S., Lin, K.: Efficient Real-Time Scheduling Algorithms for Multiprocessor Systems. IEICE Trans. on Communications E85-B, 2859–2867 (2002)
Dhall, S.K., Liu, C.L.: On a Real-Time Scheduling Problem. Information Processing Letters 26, 127–140 (1978)
Dertouzos, M., Mok, A.K.: Multiprocessor Scheduling in a Hard Real-Time Environment. IEEE Trans. on Software Engineering, 1497–1506 (1989)
Mok, A.: Task Management Techniques for Enforcing ED Scheduling on a Periodic Task Set. In: Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems, pp. 42–46 (1988)
Zuberi, K.M., Pillai, P., Shin, K.G.: EMERALDS: a small-memory real-time microkernel. In: 17th ACM Symposium on Operating Systems Principles, vol. 34, pp. 277–291 (1999)
Ha, R., Liu, J.W.S.: Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems. In: proceedings of the 14th IEEE International Conference on Distributed Computing Systems, pp. 162–171 (1994)
Liu, J.W.S.: Real-Time Systems. Prentice Hall, Englewood Cliffs (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, M., Han, S., Kim, H., Cho, S., Cho, Y. (2004). Comparison of Tie-Breaking Policies for Real-Time Scheduling on Multiprocessor. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive