Theoretical Computer Science
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
A framework for evaluating design tradeoffs in packet processing architectures
Proceedings of the 39th annual Design Automation Conference
Workload Characterization Model for Tasks with Variable Execution Demand
Proceedings of the conference on Design, automation and test in Europe - Volume 2
A General Framework for Analysing System Properties in Platform-Based Embedded System Designs
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
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
Complex task activation schemes in system level performance analysis
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
An Algorithmic Toolbox for Network Calculus
Discrete Event Dynamic Systems
A recursive approach to end-to-end path latency computation in heterogeneous multiprocessor systems
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Non preemptive static priority with network calculus: enhancement
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
| Hi-index | 0.00 |
In distributed real-time systems an application can comprehend several electronic control units interconnected by buses. To verify the real-time requirements of the application a bound for the worst-case response time or the path latency is required. With the real-time calculus a bound can be computed by using an aggregated service curve. The calculation of this aggregated service curve requires the convolution of functions which can be computational expensive. The systems we consider are event driven. This fact is exploited by the methods we present in this paper in order to reduce the runtime of the computation of the path latency. As basis we use the RTC Toolbox which provides the core operators of the real-time calculus and through experiments we show the runtime improvements of our new methods.