Abstract
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource requirements. We propose two new admission control approaches to address this problem. First, we present an efficient schedulability test, called utilization demand analysis, to handle periodic and aperiodic tasks with deterministic execution times. The utilization demand is defined as the processor utilization required for a mixed task set to meet deadlines with certainty, thus for deterministic deadline guarantees. We show that the utilization demand analysis eliminates the need for complicated schedulability analysis and enables on-line admission control. Second, we present a statistical admission control scheme using effective execution times to handle stochastic execution times. Effective execution times are determined from the deadline miss probability demanded by the application and stochastic properties of task execution times. Every task is associated with an effective execution time and is restricted to using processor time not exceeding its effective execution time. This scheme allows every task to meet its deadline with a specified probability without being interfered with, and greatly simplifies the admission control when combined with the utilization demand analysis.
The work reported in this paper was supported in part by the Korea Research Foundation Grant (KRF-2003-003-D00340), by the research fund of Hanyang University (HY-2003-T), by the National Research Laboratory (NRL) Grant M1-9911-00-0120, by the Institute of Computer Technology (ICT), and by the Automation and Systems Research Institute (ASRI).
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
Atlas, A.K., Bestavros, A.: Statistical Rate Monotonic Scheduling. In: IEEE Real- Time Systems Symposium, pp. 123–132. IEEE Computer Society Press, Los Alamitos (1998)
Audsley, N., Burns, A., Richardson, M., Wellings, A.: Hard Real-Time Scheduling: The Deadline-Monotonic Approach. In: IEEE Workshop on Real-Time Operating Systems and Software, pp. 133–137 (1991)
Baker, T., Shaw, A.: The Cyclic Executive Model and Ada. The Journal of Real-Time Systems 1(1), 7–25 (1989)
Buttazzo, G.: Value vs. Deadline Scheduling in Overload Conditions. In: IEEE Real-Time Systems Symposium, pp. 90–99. IEEE Computer Society Press, Los Alamitos (1995)
Chetto, H., Chetto, M.: Some Results of the Earliest Deadline First Scheduling Algorithm. IEEE Transactions on Software Engineering 15(10), 1261–1268 (1989)
Davis, R., Tindell, K., Burns, A.: Scheduling Slack Time in Fixed Priority Preemptive Systems. In: IEEE Real-Time Systems Symposium, pp. 222–231. IEEE Computer Society Press, Los Alamitos (1993)
Fohler, G.: Joint Scheduling of Distributed Complex Periodic and Hard Aperiodic Tasks in Statically Scheduled Systems. In: IEEE Real-Time Systems Symposium, pp. 22–33. IEEE Computer Society Press, Los Alamitos (1995)
Isovic, D., Fohler, G.: Online Handling of Hard Aperiodic Tasks in Time Triggered Systems. In: The 11th Euromicro Conference on Real-Time Systems (1999)
Johnson, J.R., Johnson, R.W.: Challenges of Computing the Fast Fourier Transform. In: Optimized Portable Application Libraries Workshop (1997)
Lehoczky, J.P.: Real-Time Queueing Theory. In: IEEE Real-Time Systems Symposium, pp. 186–195. IEEE Computer Society Press, Los Alamitos (1996)
Lehoczky, J.P., Ramos-Thuel, S.: An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems. In: IEEE Real-Time Systems Symposium, pp. 110–123. IEEE Computer Society Press, Los Alamitos (1992)
Lehoczky, J.P., Sha, L., Ding, Y.: The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior. In: IEEE Real-Time Systems Symposium, pp. 166–171. IEEE Computer Society Press, Los Alamitos (1989)
Lehoczky, J.P., Sha, L., Strosnider, J.: Enhanced Aperiodic Responsiveness in Hard Real-Time Environments. In: IEEE Real-Time Systems Symposium, pp. 261–270. IEEE Computer Society Press, Los Alamitos (1987)
Leung, J., Merill, M.: A Note on the Preemptive Scheduling of Periodic, Real-Time Tasks. Information Processing Letters 11(3), 115–118 (1980)
Liu, C., Layland, J.: Scheduling Algorithm for Multiprogramming in a Hard Real- Time Environment. Journal of the ACM 20(1), 46–61 (1973)
Sprunt, B., Sha, L., Lehoczky, J.P.: Aperiodic Task Scheduling for Hard-Real-Time Systems. The Journal of Real-Time Systems 1(1), 27–60 (1989)
Spuri, M., Buttazzo, G.: Scheduling Aperiodic Tasks in Dynamic Priority Systems. Journal of Real-Time Systems 10(2), 1979–2012 (1996)
Tia, T.-S., Deng, Z., Shankar, M., Storch, M., Sun, J., Liu, L.-C.: Probabilistic Performance Guarantee for Real-Time Tasks with Varying Computation Times. In: IEEE Real-Time Technology and Applications Symposium, pp. 164–173 (1995)
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
Ryu, M., Hong, S. (2004). Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks. In: Chen, J., Hong, S. (eds) Real-Time and Embedded Computing Systems and Applications. RTCSA 2003. Lecture Notes in Computer Science, vol 2968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24686-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-24686-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21974-3
Online ISBN: 978-3-540-24686-2
eBook Packages: Springer Book Archive