Conclusion
One of the issues raised by the editorial of Stankovic and Ramamritham is that of using unbounded software components within the context of real-time systems. We have attempted to give a different perspective to this issue; specifically how can we increase at run-time, the utility of 100% guaranteed tasks. We believe that many future systems will contain predominantly crucial computations. The need to have full predictability remains. Indeed, there is a need to develop platforms that have realistic worst case performance to probability levels compatible with the overall failure hypothesis.
References
Dix, A., Stone, R.F. and Zedan, H. (1990). “Design Issues for Reliability Time-Critical Systems. in Zedan, H. (ed.). Proc. 1989 Real-Time Systems Symposium: Theory and Applications. North Holland, pp. 305–322.
Shih, W.K., Liu, J.W.S. and Chung, J.Y. (1989). Algorithms for Scheduling Imprecise Computations with Timing Constraints. Proceedings 10th IEEE Real-Time Systems Symposium.
Stankovic, J.A. (1988). Misconceptions About Real-Time Computing. IEEE Computer 21.
Stankovic, J.A. and Ramamritham, K. (1990). What is Predictability for Real-Time Systems. Ral-Time Systems 2,4:247–254.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burns, A., Wellings, A.J. Correspondence: Criticality and utility in the next generation. The Journal of Real-Time Systems 3, 351–354 (1991). https://doi.org/10.1007/BF00365997
Issue Date:
DOI: https://doi.org/10.1007/BF00365997