Abstract
In dependable embedded real-time systems, typically built of computing nodes exchanging messages over reliability-constrained networks, the provision of schedulability guarantees for task and message sets under realistic fault and error assumptions is an essential requirement, though complex and tricky to achieve. An important factor to be considered in this context is the random nature of occurrences of faults and errors, which, if addressed in the traditional schedulability analysis by assuming a rigid worst-case occurrence scenario, may lead to inaccurate results. In this work we propose a framework for end-to-end probabilistic schedulability analysis for real-time tasks exchanging messages over Controller Area Network under stochastic errors.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Stankovic, J.A., Ramamritham, K.: Hard Real-Time Systems Tutorial. IEEE Computer Society Press (1988)
Thekkilakattil, A., Dobrin, R., Punnekkat, S.: Preemption Control using CPU Frequency Scaling in Real-Time Systems. In: 18th International Conference on Control Systsems and Computer Science (2011)
Navet, N.: Controller Area Networks: CAN’s use within Automobiles. IEEE Potentials, 12–14 (1998)
Pop, F., Baron, O.-A., Cristea, V.: Rescheduling Services for Reliable Distributed Systems. In: 18th International Conference on Control Systsems and Computer Science (2011)
Casparsson, L., Rajnak, A., Tindell, K., Malmberg, P.: Volcano – a Revolution in On-board Communication. Volvo Technology Report. 98-12-10 (1998)
Burns, A., Punnekkat, S., Strigini, L., Wright, D.R.: Probabilistic Scheduling Guarantees for Fault-Tolerant Real-Time Systems. In: Dependable Computing for Critical Applications, pp. 361–378 (1999)
Audsley, N.C., Burns, A., Richardson, M.F., Tindell, K., Wellings, A.J.: Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling. Software Engineering Journal 8, 284–292 (1993)
Joseph, M., Pandya, P.: Finding Response Times in a Real-Time System. The Computer Journal - British Computer Society 29, 390–395 (1986)
Tindell, K., Burns, A., Wellings, A.: Calculating Controller Area Network (CAN) Message Response Times. Control Engineering Practice 3, 1163–1169 (1995)
Broster, I., Burns, A., Rodriguez-Navas, G.: Probabilistic analysis of CAN with faults. In: 23rd IEEE Real-Time Systems Symposium, pp. 269–278 (2002)
Broster, I.: Flexibility in Real-Time Communication. Department of Computer Science, University of York (2003)
Navet, N., Song, Y.Q., Simonot, F.: Worst-Case Deadline Failure Probability in Real-Time Applications Distributed over Controller Area Network. Journal of Systems Architecture, 607–617 (2000)
Many, F., Doose, D.: Scheduling Analysis under Fault Bursts. In: IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 113–122 (2011)
Di Natale, M.: Scheduling the CAN Bus with Earliest Deadline Techniques. In: IEEE Real-Time Systems Symposium, pp. 259–268 (2000)
Bril, R.J., Steffens, E.F.M., Verhaegh, W.F.J.: Best-Case Response Times of Real-Time Tasks. In: 2nd Philips Workshop on Scheduling and Resource Management, pp. 19–27 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aysan, H., Dobrin, R., Punnekkat, S. (2013). Schedulability Guarantees for Dependable Distributed Real-Time Systems under Error Bursts. In: Dumitrache, L. (eds) Advances in Intelligent Control Systems and Computer Science. Advances in Intelligent Systems and Computing, vol 187. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32548-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-32548-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32547-2
Online ISBN: 978-3-642-32548-9
eBook Packages: EngineeringEngineering (R0)