Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Analysis of Tree-Shaped Transactions in Distributed Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Context-Aware Scheduling Analysis of Distributed Systems with Tree-Shaped Task-Dependencies
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Improved Schedulability Analysis of Real-Time Transactions with Earliest Deadline Scheduling
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Improved offset-analysis using multiple timing-references
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Combined approach to system level performance analysis of embedded systems
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Proceedings of the Conference on Design, Automation and Test in Europe
Sufficient real-time analysis for an engine control unit
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.01 |
During the design iterations of embedded systems, the schedulability analysis is an important method to verify whether the real-time constraints are satisfied. In order to achieve a wide acceptance in industrial companies, the analysis must be as accurate as possible and as fast as possible. The system context of the tasks has to be considered in order to accomplish an exact analysis. As this leads to longer analysis times, there is a tradeoff between accuracy and runtime. This paper introduces a general approach for the description of dependencies between tasks in distributed hard real-time systems that is able to scale the exactness and the runtime of the analysis. We will show how this concept can be applied to a real automotive application.