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

Author(s):  
Sonia Sabrina Bendib ◽  
Hamoudi Kalla ◽  
Salim Kalla

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

Author(s):  
Florian Kriebel ◽  
Kuan-Hsun Chen ◽  
Semeen Rehman ◽  
Jörg Henkel ◽  
Jian-Jia Chen ◽  
...  

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.


2021 ◽  
Author(s):  
Benny Akesson ◽  
Mitra Nasri ◽  
Geoffrey Nelissen ◽  
Sebastian Altmeyer ◽  
Robert I. Davis

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.


10.29007/npn7 ◽  
2018 ◽  
Author(s):  
Bahareh Badban ◽  
Stefan Leue ◽  
Jan-Georg Smaus

We present an approach to automatically generating invariants for timed automata models. The CIPM algorithm that we propose first computes new invariants for timed automata control locations taking their originally defined invariants as well as the constrains on clock variables imposed by incoming state transitions into account. In doing so the CIPM algorithm also prunes idle transitions, which are transitions that can never be taken, from the automaton. We discsuss a prototype implementation of the CIPM algorithm as well as some initial experimental results.


2014 ◽  
Vol 1046 ◽  
pp. 504-507
Author(s):  
Kai Song ◽  
Hai Sheng Li

In the paper, a new scheduling algorithm, priority bitmap and hash table (PBHT) algorithm, is put forward. The important parts of the scheduling algorithm, priority bitmap scheduling algorithm and hash tables are analyzed, and the workflow and time complexity of the scheduling algorithm are described in detail. Series of experiments are designed and completed. The feasibility, rationality, completeness and the scheduling algorithm are verified by the experimental results.


2021 ◽  
Vol 30 (05) ◽  
pp. 2150024
Author(s):  
Minh-Tien Nguyen ◽  
Tri-Thanh Nguyen ◽  
Asanobu Kitamoto ◽  
Van-Hau Nguyen

Social networks, e.g. Twitter, have been proved to be almost real-time systems for spreading information, that provide a valuable information channel in emergencies, e.g. disasters. This paper presents a framework designed to distill actionable tweets. The framework tackles the diversity, large volume, and noise of tweets for providing users live information for quick responses. To do that, our framework first retrieves a large number of tweets to ensure the diversity. It next removes irrelevant and indirect tweets for reducing the volume, divides informative tweets into predefined classes for quick navigation, and groups tweets in a class into topics to preserve the diversity. Finally, it ranks tweets in each topic to extract important tweets for the user’s quick scan. For ranking, the framework utilizes event extraction to enrich the semantics and reduce the noise of tweets. After that, the framework builds event graphs for ranking to find out important tweets. To validate the efficiency of our framework, we took Twitter as a case study. Experimental results on five disaster datasets show that our framework achieves promising results compared to strong methods in disaster scenarios.


2018 ◽  
Vol 14 (04) ◽  
pp. 94
Author(s):  
Qian Zhongsheng ◽  
Li Xin ◽  
Wang Xiaojin

The characteristics of three popular model checking tools called SPIN, UPPAAL and NuSMV respectively, are compared and analyzed to determine which type of systems is propitious to be described. And a distributed elevator system model is built, whose related properties are verified and compared by these three model checking tools. To begin with, SPIN, UPPAAL and NuSMV, whose modeling language features are compared, are employed to construct an elevator system model respectively. Then, the three validation tools are used to verify several important properties of the elevator model, and the result is analyzed and their own characteristics are summarized. Finally, the experimental results show that SPIN and NuSMV are more suitable for verifying distributed systems while UPPAAL is better for verifying real-time systems.


Author(s):  
Witold Kinsner

This paper presents an overview of designpatterns for teaching an undergraduate course oninterfacing of microcontrollers, microprocessors andmicrocomputers for real-time systems. Such design patternsare useful because the course must cover a wide range oftopics for both wired and wireless systems, and is intendedfor a variety of microcontrollers. Without the patterns,teaching all the material from ground up might not befeasible.


Sign in / Sign up

Export Citation Format

Share Document