Abstract
The prediction of best-case response time is quite necessary to guarantee control accuracy and stability of distributed hard real-time systems. Published time analysis techniques can precisely dealt with the precedence relations between tasks on different processors, but usually ignored or inaccurately estimated the effects from the precedence relations between tasks on the same processor. This leads to a pessimistic analysis. This paper presents an algorithm to analyze the best-case end-to-end response time for hard real-time distributed systems. This algorithm extends the traditional analysis technique by exploiting the precedence relations between tasks on both different processors and the same processor and achieves a more accurate analysis. Simulation results have shown that this algorithm can achieve more accurate results than existing methods.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)
Lehoczky, J.P.: Fixed Priority Scheduling of Periodic Task Sets With Arbitrary Deadlines. In: Proceedings of the 11th IEEE Real-Time Systems Symposium, pp. 201–209. IEEE Computer Society Press, Los Alamitos (1990)
Klein, M., Ralya, T., Pollack, B., Obenza, R., Harbour, M.G.: A Practitioners Handbook for Real-Time Systems Analysis. Kluwer Academic Publishers, Dordrecht (1993)
Tindell, K., Clark, J.: Holistic Schedulability Analysis for Distributed Hard Real-Time Systems. Microprocessing & Microprogramming 50(2-3), 117–134 (1994)
Palencia, J.C.G., García, J.J.G., Harbour, M.G.: Best-Case Analysis for Improving the Worst-Case Schedulability Test for Distributed Hard Real-Time Systems. In: Proceedings of 10th Euromicro Workshop on Real-Time Systems, pp. 35–44. IEEE Computer Society Press, Los Alamitos (1998)
Henderson, W., Kendall, D., Robson, A.: Improving the Accuracy of Scheduling Analysis Applied to Distributed Systems. Journal of Real-Time Systems 20(1), 5–25 (2001)
Redell, O., Sanfridson, M.: Exact Best-Case Response Time Analysis of Fixed Priority Scheduled Tasks. In: the 14th Euromicro Conference on Real-Time Systems, pp. 165–172 (2002)
Harbour, M.G., Klein, M.H., Lehoczky, J.P.: Fixed Priority Scheduling of Periodic Tasks with Varying Execution Priority. In: Proceedings of Real-Time Systems Symposium, pp. 116–128. IEEE Computer Society Press, Los Alamitos (1991)
Audsley, N.C., Burns, A., Tindell, K., Richardson, M., Wellings, A.: Applying New Scheduling Theory To Static Priority Pre-emptive Scheduling. Software Engineering Journal 8(5), 284–292 (1993)
Tindell, K., Burns, A., Wellings, A.J.: Analysis of hard real-time communications. Journal of Real-Time Systems 9, 147–171 (1995)
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
Wang, L., Zhao, M., Zheng, Z., Wu, Z. (2005). Exact Best-Case End-to-End Response Time Analysis for Hard Real-Time Distributed Systems. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_20
Download citation
DOI: https://doi.org/10.1007/11569596_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29414-6
Online ISBN: 978-3-540-32085-2
eBook Packages: Computer ScienceComputer Science (R0)