Abstract
The Stack Resource Policy (SRP) is a real-time synchronization protocol suitable for embedded systems for its simplicity. However, if SRP is applied to dynamic priority scheduling, the runtime overhead of job selection algorithms could affect the performance of the system seriously. To solve the problem, a job selection algorithm was proposed that uses a selection tree as a scheduling queue structure. The proposed algorithm selects a job in O(⌈log 2 n⌉) time, resulting in significant reduction in the run-time overhead of scheduler. In this paper, the correctness of the job selection algorithm is presented. Also, the job selection algorithm was implemented in GSM/GPRS handset with ARM7 processor to see its effectiveness on embedded systems. The experiments performed on the system show that the proposed algorithm can further utilize the processor by reducing the scheduling overhead.
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
Sha, L., Rajkumar, R., Lehoczky, J.: Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers 39, 1175–1185 (1990)
Chen, M.I., Lin, K.J.: Dynamic priority ceilings: A concurrency control protocal for real-time systems. real-time systems 2, 325–346 (1990)
Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of ACM 20, 46–61 (1973)
Jeffay, K.: Scheduling sporadic tasks with shared resources in hard-real-time systems. In: Proceedings of 13th IEEE Real-Time Systems Symposium, pp. 89–99 (1992)
Baker, T.P.: Stack-based scheduling of real-time processes. Real-Time Systems 3, 67–100 (1991)
Han, S., Park, M., Cho, Y.: An efficient job selection scheme in real-time scheduling under the stack resource policy. In: Proceedings of the 17th International Parallel and Distributed Processing Symposium, p. 118 (2003)
Liu, J.W.S.: Real-Time Systems. Prentice-Hall, Englewood Cliffs (2000)
Knuth, D.E.: The Art of Computer Programming, vol. 3. Addison-Wesley, Reading (1998)
Zuberi, K.M., Pillai, P., Shin, K.G.: EMERALDS: a small-memory real-time microkernel. In: Proceedings of 17th ACM Symposium on Operating Systems Principles, pp. 277–299 (1999)
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
Han, S., Park, M., Cho, Y. (2005). Fast Real-Time Job Selection with Resource Constraints Under Earliest Deadline First. In: Hämäläinen, T.D., Pimentel, A.D., Takala, J., Vassiliadis, S. (eds) Embedded Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2005. Lecture Notes in Computer Science, vol 3553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11512622_26
Download citation
DOI: https://doi.org/10.1007/11512622_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26969-4
Online ISBN: 978-3-540-31664-0
eBook Packages: Computer ScienceComputer Science (R0)