Etfa2011 2011
DOI: 10.1109/etfa.2011.6059009
|View full text |Cite
|
Sign up to set email alerts
|

Bounding mode change transition latencies for multi-mode real-time distributed applications

Abstract: Predicting timing behaviour is essential for the design of embedded real-time systems that can switch between different operational modes at runtime. The settling time of a mode change, called mode change transition latency, is an important system parameter. Known approaches that address the problem of timing analysis for multi-mode real-time systems are restricted to applications without communicating tasks. Also, these assume that transitions are initiated only during a steady state, however, without indicat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…In [10], [11], an analysis is proposed to reason about worst-case response time of a task graph in case of a mode change. However, the task graph has very limited expressiveness and is not able to model the behavior of adaptive streaming applications.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In [10], [11], an analysis is proposed to reason about worst-case response time of a task graph in case of a mode change. However, the task graph has very limited expressiveness and is not able to model the behavior of adaptive streaming applications.…”
Section: Related Workmentioning
confidence: 99%
“…Definition 11 (Mode Transition). A MADF graph is in a mode transition from mode SI o to SI l , where o l, if some actors have SI o for Equation (11) and the remaining active actors have SI l for Equation (11).…”
Section: Table IIImentioning
confidence: 99%
“…The focus of the previously presented work was the use of schedulability analysis on uniprocessor systems. A proposal for schedulability analysis for fixed-priority in mode-change for multi-core systems is shown in Negrean et al [9]. This approach considers the dependency between tasks that could be executed in parallel by different processors.…”
Section: A General Mode-changes In Real-time Systemsmentioning
confidence: 99%
“…Here, the focus generally lies on optimizing the switching of the system configuration, often with the goal of reducing the mode change transition latency, i.e., the settling time during the switching from one application mode to another, and the corresponding timing constraint guarantees. For instance, an algorithm to determine an upper bound for mode change transition latencies for communication-based applications is presented in [5], targeting a static preemptive priority-based scheduling and asynchronous mode change protocols. By contrast, the authors in [6] use Time Division Multiple Access (TDMA) for state-based scheduling.…”
Section: Related Workmentioning
confidence: 99%
“…The problem of defining multiple configurations for a system has been addressed in the area of multi-mode scheduling, however, with a different objective. While multimode approaches focus on optimizing the switching of the system configuration of a single system, often with the goal of minimizing the transmission delays between modes, e.g., [5][6], we address the problem of determining variant schedules with minimal differences for multiple architectures. Furthermore, several approaches have been proposed for concurrent scheduling of multiple graph-based applications, e.g., [7] [8].…”
Section: Introductionmentioning
confidence: 99%