Consistency Challenges in Self-Organizing Distributed Hard Real-Time Systems

Stein, Steffen; Neukirchner, Moritz; Schrom, Harald; Ernst, Rolf

doi:10.1109/isorcw.2010.17

Cited by 6 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Timing implications of mode changes in distributed real-time systems with communicating tasks were discussed in [3] and [13]. The main problem identified in [3] is the recurrent effect of a mode change that significantly challenges the timing of such systems.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, the processors local transition phases become parts of a global transition phase comprising the entire system. The problem of mode changes in distributed real-time system was addressed in [8,3,13]. However, the approach in [8] does not consider communication precedence relations between tasks when reasoning about the timing of the tasks during transition phases.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2011

Self Cite

View full text Add to dashboard Cite

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 indicating when a system executes in a steady state. In this paper, we present an analysis algorithm which gives a maximum bound on each mode change transition latency of multi-mode distributed applications thereby overcoming limitations of previous work. We explain the algorithm, prove its correctness, illustrate the steps and provide experimental data that show its usefulness.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

et al. 2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…All active DCS instances synchronize (e.g. using a barrier synchronization protocol as described in [27]) to ensure a consistent model. Then the DPA analyzes the modified configuration again.…”

Section: Dcs Strategymentioning

confidence: 99%

A Lazy Algorithm for Distributed Priority Assignment in Real-Time Systems

Neukirchner

Stein

Ernst

2011

2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops

Self Cite

View full text Add to dashboard Cite

Integration of system components is a crucial challenge in the design of embedded real-time systems, as complex non-functional interdependencies may exist.[20] presented a framework, enabling autonomous verification of timing properties in the system itself. The work presented in this paper, takes that approach one step further, enabling autonomuous assignment of execution priorities under timing constraints. We present a distributed heuristic algorithm for the constraint statisfaction problem (CSP) of finding feasible priority assignments in static priority preemptive (SPP) scheduled hard real-time systems. The proposed heuristic considers end-to-end path latency constraints in arbitrary task graphs mapped on arbitrary platform graphs.

show abstract