Abstract
A growing number of control systems are distributed and based on the use of a communication bus. The distributed nodes execute periodic tasks, which access the bus by releasing the messages using a priority-based mechanism with the goal of minimal message response times. Instead of randomly accessing the bus, a dynamic scheduling of messages technique based on adaptation of time offsets between message releases is used. The presented algorithm, called DynOAA, is executing on each node of the distributed system. It takes into account the current traffic on the bus and tries to avoid simultaneous release of messages by different nodes, hence reduces the likelihood of conflicts and need for repeated release. In this paper, we first address single bus (segment) systems and then extend the model and the offset adaptation algorithm to systems that use multiple buses (segments) connected by a communication gateway. A rating function based on the average of maximum response times is used to analyze DynOAA for the case of CAN-bus systems based on bit-accurate simulations. Experiments show the robustness of the algorithm (1) in case of fully asynchronous systems, (2) ability to deal with systems that change their configuration (add or remove message release nodes) dynamically and (3) model systems containing multiple bus segments connected by a gateway. The approach is also applicable to other priority-based bus systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
CAN Specification 2.0 B. Robert Bosch GmbH, Stuttgart, Germany (1991)
Bai, T., Hu, L., Wu, Z., Yang, G.: Flexible fuzzy priority scheduling of the CAN bus. Asian Journal of Control 7(4), 401–413 (2005)
Braun, C., Havet, L., Navet, N.: NETCARBENCH: A benchmark for techniques and tools used in the design of automotive communication systems. In: 7th IFAC International Conference on Fieldbuses and Networks in Industrial and Embedded Systems. Citeseer (2007)
Di Natale, M.: Scheduling the can bus with earliest deadline techniques. In: Proceedings of the 21st IEEE Real-Time Systems Symposium, pp. 259–268 (2000)
Felser, M.: Real-time ethernet - industry prospective. Proceedings of the IEEE 93(6), 1118–1129 (2005)
FlexRay Consortium. FlexRay Communications Systems - Protocol Specification v3.0 (2009), http://www.flexray.com
Goossens, J.: Scheduling of offset free systems. Real-Time Systems 24(2), 239–258 (2003)
Grenier, M., Havet, L., Navet, N.: Pushing the limits of CAN-scheduling frames with offsets provides a major performance boost. In: Proc. of the 4th European Congress Embedded Real Time Software (ERTS 2008). Citeseer, Toulouse (2008)
Pfeiffer, O., Ayre, A., Keydel, C.: Embedded networking with CAN and CANopen. Copperhill Media (2008)
Racu, R.: The role of timing analysis in automotive network design. In: Talk, 4th Symtavision News Conference on Timing Analysis, Braunschweig, Germany (2010)
RTaW-Sim. Real-time at Work CAN Simulator, http://www.realtimeatwork.com/
Ziermann, T., Salcic, Z., Teich, J.: DynOAA - Dynamic Offset Adaptation Algorithm for Improving Response Times of CAN Systems. In: Proceedings of Design, Automation and Test in Europe (DATE 2011), March 14-18, IEEE Computer Society, Grenoble (2011)
Zuberi, K.M., Shin, K.G.: Non-preemptive scheduling of messages on controller area network for real-time control applications. In: rtas, p. 240. IEEE Computer Society, Los Alamitos (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ziermann, T., Salcic, Z., Teich, J. (2011). Self-organized Message Scheduling for Asynchronous Distributed Embedded Systems. In: Calero, J.M.A., Yang, L.T., Mármol, F.G., García Villalba, L.J., Li, A.X., Wang, Y. (eds) Autonomic and Trusted Computing. ATC 2011. Lecture Notes in Computer Science, vol 6906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23496-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-23496-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23495-8
Online ISBN: 978-3-642-23496-5
eBook Packages: Computer ScienceComputer Science (R0)