Achieving timing composability with measurement-based probabilistic timing analysis
Document typeConference report
Rights accessRestricted access - publisher's policy
Probabilistic Timing Analysis (PTA) allows complex hardware acceleration features, which defeat classic timing analysis, to be used in hard real-time systems. PTA can do that because it drastically reduces intrinsic dependence on execution history. This distinctive feature is a great facilitator to time composability, which is a must for industry needing incremental development and qualification. In this paper we show how time composability is achieved in PTA-conformant systems and how the pessimism of worst-case execution time bounds obtained from PTA is contained within a 5% to 25% range for representative application scenarios
CitationKosmidis, L. [et al.]. Achieving timing composability with measurement-based probabilistic timing analysis. A: IEEE Computer Society symposium on object/component/service-oriented realtime distributed computing. "The IEEE International Symposium on Object/component/service-oriented Real-time distributed computing: Paderborn, Germany, June 19 - 21, 2013". Paderborn: 2013, p. 1-8.
|isorc_2013.pdf||Achieving Timing Composability with||413,8Kb||Restricted access|