Abstract
Though schedulability analysis has matured to the point where it is now possible to analyse realistic systems, there is still a lack of flexibility as far as the designer is concerned. Feasibility tests often provide little or no indication of the changes in task timing characteristics required to achieve a feasible system, nor any indication of the extent to which the worst case execution times of tasks may be increased without causing deadlines to be missed (in the case of a feasible system). In practice, however, it is useful to know how sensitive system feasibility is to changes in task timing characteristics. We give a general approach to the sensitivity analysis of task sets, which aids system developers in incorporating changes to the system whilst ensuring that the schedulability guarantees remain intact.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
N. C. Audsley, A. Burns, M.F. Richardson, K. Tindell, and A.J. Wellings. Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling. Software Engineering Journal, 8(5):284–292, September 1993.
A. Burns, R.I. Davis, and S. Punnekkat. Feasibility and Sensitivity Analysis of Fault-tolerant task sets. Submitted for Publication, March 1996.
D.I. Katcher, H. Arakawa, and J.K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Transactions on Software Engineering, 19(9):920–934, September 1993.
M. H. Klein, T. Ralya, B. Pollak, R. Obebza, and M. G. Harbour, editors. Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, 1993.
J.P. Lehoczky, L. Sha, and Y. Ding. The Rate Monotonic Scheduling Algorithm — Exact characterization and average case behaviour. Proceedings of IEEE Real-Time Systems Symposium, pages 166,171, December 1989.
S. Punnekkat. Schedulability Analysis for Fault Tolerant Real-time Systems. PhD thesis, Dept. Computer Science, University of York, June 1997.
L. Sha, R. Rajkumar, and J.P. Lehoczky. Priority Inheritance Protocols: An Approach to Real-Time Synchronization. IEEE Transactions on Computers, 39(9):1175–1185, September 1990.
K. W. Tindell, A. Burns, and A. J. Wellings. An Extendible Approach for Analysing Fixed Priority Hard Real-Time Tasks. Journal of Real-Time Systems, 6(2):133–151, March 1994.
S. Vestal. Fixed Priority Sensitivity Analysis for Linear Compute Time Models. IEEE Transactions on Software Engineering, 20(4):308–317, April 1994.
R. Yerraballi, R. Mukkamala, K. Maly, and H.A. Wahab. Issues in Schedulability Analysis of Real-Time Systems. Proceedings of Seventh Euromicro Workshop on Real-Time Systems, pages 87–92, June 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Punnekkat, S., Davis, R., Burns, A. (1997). Sensitivity analysis of real-time task sets. In: Shyamasundar, R.K., Ueda, K. (eds) Advances in Computing Science — ASIAN'97. ASIAN 1997. Lecture Notes in Computer Science, vol 1345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63875-X_44
Download citation
DOI: https://doi.org/10.1007/3-540-63875-X_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63875-9
Online ISBN: 978-3-540-69658-2
eBook Packages: Springer Book Archive