Abstract
The real-time systems have a set of processes continuously running in the system and will also have a set of processes triggered on events or user interaction. In such systems, the number of processes in scheduling queue varies based on frequency of trigger activation. The hard real-time systems are designed to meet the deadline of all processes under peak load of processes. Hence, the execution speed of the processing unit is chosen much higher than the required speed for average load. The DVFS technique addresses the issue based on process load; however, it does not take deadlines into account while scaling the processors operating frequency.
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
Similar content being viewed by others
References
Zhang, F., Burns, A., Baruah, S.: Sensitivity Analysis of Arbitrary Deadline Real-Time Systems with “EDF” Scheduling. Springer Science Business Media, LLC, Berlin (2011)
Ra, O., Torbjo: Trends and Challenges in Embedded Systems—CoDeVer and HiBu Experiences. Corpus ID: 15066429 (2003)
Balbastre, P., Ripoll, I., Crespo, A.: Minimum deadline calculation for periodic real-time tasks in dynamic priority systems. IEEE Trans. Comput. 57(1), 96–109 (2007)
Lee, S., Kim, H., Lee, J.: Soft Aperiodic Task Scheduling Algorithm in Dynamic-Priority Systems. KOSEF under Grant No. 941-0900-046-2. IEEE (1995)
Spruntlui, B., Sha, L., Lehoczky, J.: Aperiodic task scheduling for hard-real-time systems. J. Real-Time Syst. 1, 27–60 (1989)
Chen, C.-Y., Hasan, M., Ghassami, A.E., Mohan, S., Kiyavash, N.: Securing Dynamic-Priority Real-Time Systems Using Schedule Obfuscation. arXiv: 1806.01393v1 [cs.CR] (2018)
Morton, A., Loucks, W.M.: “EDF” Feasibility Analysis of Accelerated Tasks. University of Waterloo, Waterloo, Ontario, Canada. IEEE (2007)
Kargahi, M., Movaghar, A.: A method for performance analysis of earliest-deadline-first scheduling policy. In: Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN’04) 0-7695-2052-9/04 © 2004 IEEE
Morton, A., Loucks, W.M.: “EDF” Feasibility Analysis of Accelerated Tasks. 0840-7789/07©2007 IEEE
Short, M.: Improved Schedulability analysis of implicit deadline tasks under limited preemption “EDF” scheduling. In: IEEE ETFA’2011
Zhang, F.: Schedulability analysis for real-time systems with “EDF” scheduling. IEEE Trans. Comput. 58 (2009)
Lehoczky, J.P., Sha, L., Ding, Y.: The rate-monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 166–171 (1989)
Bini, E., Buttazzo, G.C., Buttazzo, G.M.: A hyperbolic bound for the rate monotonic algorithm. In: 2001 Proceedings of the 13th Euromicro Conference on Real-Time Systems. Delft, the Netherlands, pp. 59–66
Buttazzo, G.C.: Rate Monotonic vs. “EDF”: Judgment Day. Springer Science Business Media, Inc., The Netherlands (2005)
Cervin, A., Eker, J., Bernhardsson, B., Arzen, K.-E.: Feedback-feedforward scheduling of control tasks. Real-Time Syst. 23(1), 25–53 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Chapalkar, S.S., Karibasappa, K. (2022). Effect of Dynamic Process Load Variation on Relative Deadlines in Multitasking Embedded Systems. In: Joshi, A., Mahmud, M., Ragel, R.G., Thakur, N.V. (eds) Information and Communication Technology for Competitive Strategies (ICTCS 2020). Lecture Notes in Networks and Systems, vol 191. Springer, Singapore. https://doi.org/10.1007/978-981-16-0739-4_44
Download citation
DOI: https://doi.org/10.1007/978-981-16-0739-4_44
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-0738-7
Online ISBN: 978-981-16-0739-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)