Abstract
Efficient schedulability tests are required to check the schedulability of real-time systems, especially for online use. Since exact tests are very time consuming, great efforts have been paid to search for more efficient tests. Sufficient tests have been widely studied for they are usually performance efficiency. If a task set is proved schedulable by the sufficient test, then the exact response time does not need to be calculated. In this paper, we discuss the way of how to find better initial values for sufficient schedulability tests. Four parametric initial values are proposed and each can be tuned using a delta-parameter to reduce the number of iterations needed by response time calculation. Extensive evaluations show that the schedulability tests found by our method need less runtime than state of the art approaches.
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 subscriptionsReferences
Yang, M.F., Gu, B., Guo, X.Y., et al.: Aerospace embedded software dependability guarantee technology and application. Sci. Sin. Tech. 45, 198–203 (2015)
Yang, M.F., Wang, L., Gu, B., Zhao, L.: The application of CPS to spacecraft control systems. Aerosp. Control Appl. 38(5), 8–13 (2012)
Lehoczky, J.P., Sha, L., Ding, Y.: The rate-monotonic scheduling algorithm: exact characterization and average case behavior. In: IEEE Real-Time Systems Symposium (RTSS), pp. 166–171 (1989)
Joseph, M., Pandya, P.K.: Finding response times in a real-time system. Comput. J. 29, 390–395 (1986)
Audsley, N.C., Burns, A., Richardson, M., Wellings, A.J.: Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J. 8, 284–292 (1993)
Eisenbrand, F., Rothvoss, T.: Static-priority real-time scheduling: response time computation is NP-hard. In: IEEE Real-Time Systems Symposium (RTSS) (2008)
Davis, R.I., Zabos, A., Burns, A.: Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57(9), 1261–1276 (2008)
Bini, E., Nguyen, T.H.C., Richard, P., Baruah, S.K.: A response-time bound in fixed-priority scheduling with arbitrary deadlines. IEEE Trans. Comput. 58(2), 279–286 (2009)
Bini, E., Parri, A., Dossena, G.: A quadratic-time response time upper bound with a tightness property. In: IEEE Real-Time Systems Symposium (RTSS) (2015)
Fisher, N., Goossens, J., Nguyen, T.H.C., Richard, P.: Parametric polynomial-time algorithms for computing response-time bounds for static-priority tasks with release jitters. In: IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA) (2007)
Nguyen, T., Richard, P., Bini, E.: Approximation techniques for response-time analysis of static-priority tasks. Real-Time Syst. 43, 147–176 (2009)
Lu, Q., Cheng, A.M.K., Davis, R.I.: Tunable response time upper bound for fixed priority real-time systems. In: IEEE Real-Time and Embedded Technology and Applicaions Symposium (WIP session) (2015)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a real-time environment. J. ACM 20, 46–61 (1973)
Lehoczky, J.P.: Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: IEEE Real-Time Systems Symposium (RTSS) (1990)
Sjödin, M., Hansson, H.: Improved response time analysis calculations. In: IEEE Real-Time Systems Symposium (RTSS), pp. 399–408 (1998)
Bini, E., Baruah, S.K.: Efficient computation of response time bounds under fixed-priority scheduling. In: International Conference on Real-Time Networks and Systems, pp. 95–104 (2007)
Davis, R.I., Burns, A.: Response time upper bounds for fixed priority real-time systems. In: IEEE Real-Time Systems Symposium (RTSS) (2008)
Lu, W.C., Lin, K.J., Wei, H.W., Shih, W.K.: Period-dependent initial values for exact schedulability test of rate monotonic systems. In: International Parallel and Distributed Processing Symposium (IPDPS) (2007)
Bini, E., Buttazzo, G.C.: Measuring the performanc of schedulability tests. Real-Time Syst. 30, 129–154 (2005)
Min-Allah, N., Khan, S.U., Ghani, N., Li, J., Wang, L.Z., Bouvry, P.: A comparative study of rate monotonic schedulability tests. J. Supercomput. 59, 1419–1430 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Yu, G., Yang, M., Sun, H., Jiang, H. (2016). Improving the Efficiency of Schedulability Tests for Fixed Priority Preemptive Systems. In: Lee, R. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing. Studies in Computational Intelligence, vol 653. Springer, Cham. https://doi.org/10.1007/978-3-319-33810-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-33810-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33809-5
Online ISBN: 978-3-319-33810-1
eBook Packages: EngineeringEngineering (R0)