scholarly journals A comprehensive survey of industry practice in real-time systems

2021 ◽  
Author(s):  
Benny Akesson ◽  
Mitra Nasri ◽  
Geoffrey Nelissen ◽  
Sebastian Altmeyer ◽  
Robert I. Davis
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Survey Data ◽  
Common Knowledge ◽  
Academic Research ◽  
Real Time Systems ◽  
The Real ◽  
Industry Practice ◽  
Comprehensive Survey ◽  
Time Systems

AbstractThis paper presents results and observations from a survey of 120 industry practitioners in the field of real-time embedded systems. The survey provides insights into the characteristics of the systems being developed today and identifies important trends for the future. It extends the results from the survey data to the broader population that it is representative of, and discusses significant differences between application domains. The survey aims to inform both academics and practitioners, helping to avoid divergence between industry practice and academic research. The value of this research is highlighted by a study showing that the aggregate findings of the survey are not common knowledge in the real-time systems community.

The Real-Time Systems Compiler: migrating event-triggered systems to time-triggered systems

2011 ◽  
Vol 41 (12) ◽  
pp. 1491-1515 ◽  
Author(s):  
Fabian Scheler ◽  
Wolfgang Schröder-Preikschat
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
The Real ◽  
Time Systems ◽  
Event Triggered

scholarly journals Proceedings of the Real-Time Systems Engineering Workshop

2001 ◽  
Author(s):  
B. C. Meyers ◽  
Peter H. Feiler ◽  
Ted Marz
Keyword(s):  
Real Time ◽  
Systems Engineering ◽  
Real Time Systems ◽  
The Real ◽  
Time Systems

scholarly journals Dependable Software Generation and Execution on Embedded Systems

2020 ◽  
pp. 139-160
Author(s):  
Florian Kriebel ◽  
Kuan-Hsun Chen ◽  
Semeen Rehman ◽  
Jörg Henkel ◽  
Jian-Jia Chen ◽  
...  
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Relevant Information ◽  
Real Time Systems ◽  
System Software ◽  
Analysis Techniques ◽  
Functional Aspects ◽  
Depth Analysis ◽  
Time Systems ◽  
Error Masking

AbstractFor generating and executing dependable software, the effects of hardware layer faults at the software layer have to be accurately analyzed and modeled. This requires relevant information from the hardware and software layers, as well as an in-depth analysis of how an application’s outputs are affected by errors, and quantifying the error masking and error propagation on the software layer. Based on this analysis, techniques for generating dependable software can be proposed, e.g., by different dependability-aware compiler-based software transformations or selective instruction protection. Beside functional aspects, timing also plays an important role, as oftentimes tasks have to be finished before a certain deadline to provide useful information, especially in real-time systems. Both aspects are jointly taken into account by the run-time system software which decides—with the help of offline and online-generated data—for multiple concurrently executing applications how to protect and when to execute which application task to optimize for dependability and timing correctness. This is achieved for example by selecting appropriate application versions and protection levels for single and multi-core systems—for example using redundant multithreading (RMT) in different modes—under tolerable performance overhead constraints.

scholarly journals Bi-objective Scheduling with cooperating Heuristics for Embedded Real-Time Systems

2018 ◽  
Vol 9 (3) ◽  
pp. 789
Author(s):  
Sonia Sabrina Bendib ◽  
Hamoudi Kalla ◽  
Salim Kalla
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Heuristic Algorithm ◽  
Approximate Solutions ◽  
Search Space ◽  
Experimental Results ◽  
Scheduling Problem ◽  
Np Hard ◽  
Real Time Systems ◽  
Time Systems

This paper proposes Makespan and Reliability based approach, a static sheduling strategy for distributed real time embedded systems that aims to optimize the Makespan and the reliability of an application. This scheduling problem is NP-hard and we rely on a heuristic algorithm to obtain efficiently approximate solutions. Two contributions have to be outlined: First, a hierarchical cooperation between heuristics ensuring to treat alternatively the objectives and second, an Adapatation Module allowing to improve solution exploration by extending the search space. It results a set of compromising solutions offering the designer the possibility to make choices in line with his (her) needs. The method was tested and experimental results are provided

scholarly journals Real-time Issues in the Ada Parallel Model with OpenMP

2021 ◽  
Vol 40 (2) ◽  
pp. 96-102
Author(s):  
Luis Miguel Pinho ◽  
Sara Royuela ◽  
Eduardo Quiñones
Keyword(s):  
Real Time ◽  
General Model ◽  
Parallel Model ◽  
Real Time Systems ◽  
The Real ◽  
Fine Grain ◽  
Parallel Features ◽  
Time Systems ◽  
Current Proposal ◽  
Open Issues

The current proposal for the next revision of the Ada language considers the possibility to map the language parallel features to an underlying OpenMP runtime. As previously presented, and discussed in previous workshops, the works on fine-grain parallelism in Ada map well to the OpenMP tasking model for parallelism. Nevertheless, and although the general model of integration, and the semantic constructs are already reflected in the proposed revision of the standard, the integration of these new features with the Real-Time Systems Annex of Ada is still not complete. This paper presents an overview of what is supported and the still open issues.

AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS

1999 ◽  
Vol 09 (02) ◽  
pp. 203-216 ◽  
Author(s):  
AVINAS SAHAY ◽  
JEFFREY J. P. TSAI ◽  
A. PRASAD SISTLA
Keyword(s):  
State Space ◽  
Real Time ◽  
Minimum Cost ◽  
Incremental Algorithm ◽  
Real Time Systems ◽  
The Real ◽  
Verification Algorithm ◽  
Time Extension ◽  
Time Systems ◽  
Infinite State

We present an incremental algorithm for model checking the real-time systems against the requirements specified in the real-time extension of modal mu-calculus. Using this algorithm, we avoid the repeated construction and analysis of the whole state-space during the course of evolution of the system from time to time. We use a finite representation of the system, like most other algorithms on real-time systems. We construct and update a graph (called TSG) that is derived from the region graph and the formula. This allows us to halt the construction of this graph when enough nodes have been explored to determine the truth of the formula. TSG is minimal in the sense of partitioning the infinite state space into regions and it expresses a relation on the set of regions of the partition. We use the structure of the formula to derive this partition. When a change is applied to the timed automaton of the system, we find a new partition from the current partition and the TSG with minimum cost.

Sign in / Sign up

Export Citation Format

Share Document