Optimizing End-to-End Latencies by Adaptation of the Activation Events in Distributed Automotive Systems

Schedulability theory provides support for the analysis of the worst case latencies in distributed computations when the architecture of the system is known and the communication and synchronization mechanisms have been defined. In the design of complex automotive systems, however, a great benefit of schedulability analysis may come from its use as an aid in the exploration of the software architecture configurations that can best support the target application. We present an optimization algorithm that leverages the trade-offs between the purely periodic and the data-driven activation models to meet the latency requirements of distributed vehicle functions. We demonstrate its effectiveness on a complex automotive architecture

[1]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  Efficient embedded software design with synchronous models , 2005, EMSOFT.

[3]  Manas Saksena,et al.  Resource conscious design of distributed real-time systems: An end-to-end approach , 1996, Proceedings of ICECCS '96: 2nd IEEE International Conference on Engineering of Complex Computer Systems (held jointly with 6th CSESAW and 4th IEEE RTAW).

[4]  Petru Eles,et al.  Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems , 2002, Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627).

[5]  John P. Lehoczky,et al.  Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems , 1994, IEEE Trans. Software Eng..

[6]  Rolf Ernst,et al.  Applying Sensitivity Analysis in Real-Time Distributed Systems , 2005, IEEE Real-Time and Embedded Technology and Applications Symposium.

[7]  Rolf Ernst,et al.  SymTA/S - Symbolic Timing Analysis for Systems , 2004 .

[8]  Stavros Tripakis,et al.  Semantics-preserving and memory-efficient implementation of inter-task communication on static-priority or EDF schedulers , 2005, EMSOFT.

[9]  Jane W.-S. Liu.  Real-Time Systems , 2000, Encyclopedia of Algorithms.

[10]  Lothar Thiele,et al.  A new task model for streaming applications and its schedulability analysis , 2005, Design, Automation and Test in Europe.

[11]  Norman Scaife,et al.  Integrating model-based design and preemptive scheduling in mixed time- and event-triggered systems , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[12]  Richard Gerber,et al.  Guaranteeing Real-Time Requirements With Resource-Based Calibration of Periodic Processes , 1995, IEEE Trans. Software Eng..

[13]  Giorgio C. Buttazzo,et al.  Sensitivity Analysis for Fixed-Priority Real-Time Systems , 2006, ECRTS.

[14]  Hermann Kopetz,et al.  Distributed fault-tolerant real-time systems: the Mars approach , 1989, IEEE Micro.

[15]  Alan Burns,et al.  Calculating controller area network (can) message response times , 1994 .

[16]  Giorgio C. Buttazzo,et al.  Sensitivity analysis for fixed-priority real-time systems , 2006, 11th IEEE Real Time and Embedded Technology and Applications Symposium.

[17]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[18]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[19]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[20]  Thomas A. Henzinger,et al.  Trading end-to-end latency for composability , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).