Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Sensitivity Analysis of Real-Time Task Sets
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Measuring the Performance of Schedulability Tests
Real-Time Systems
A formal approach to robustness maximization of complex heterogeneous embedded systems
CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
Robust Priority Assignment for Fixed Priority Real-Time Systems
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Sensitivity analysis of complex embedded real-time systems
Real-Time Systems
Sensitivity analysis for fixed-priority real-time systems
Real-Time Systems
Providing accurate event models for the analysis of heterogeneous multiprocessor systems
CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP 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
Monitoring Arbitrary Activation Patterns in Real-Time Systems
RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium
Multi-mode monitoring for mixed-criticality real-time systems
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
| Hi-index | 0.00 |
Response time analysis, which determines whether timing guarantees are satisfied for a given system, has matured to industrial practice and is able to consider even complex activation patterns modelled through arrival curves or minimum distance functions. On the other side, sensitivity analysis, which determines bounds on parameter variations under which constraints are still satisfied, is largely restricted to variation of single-valued parameters as e.g. task periods. In this paper we provide a sensitivity analysis to determine the bounds on the admissible activation pattern of a task, modelled through a minimum distance function. In an evaluation on a set of synthetic testcases we show, that the proposed algorithm provides significantly tighter bounds, than previous exact analyses, that determine allowable parametrizations of activation patterns.