Class-based query-optimization for minimizing worst-case execution times of diagnostic queries in embedded real-time systems

2017 ◽  
Author(s):  
Nadra Tabassam ◽  
Roman Obermaisser
Keyword(s):  
Real Time ◽  
Query Optimization ◽  
Real Time Systems ◽  
Worst Case ◽  
Execution Times ◽  
Time Systems

scholarly journals PSO based optimization of worst-case execution time for ASIP application

2018 ◽  
Vol 7 (3.3) ◽  
pp. 252
Author(s):  
Mood Venkanna ◽  
Rameshwar Rao ◽  
P Chandra Sekhar
Keyword(s):  
Real Time ◽  
Upper Bounds ◽  
Real Time Systems ◽  
Worst Case ◽  
Reconfigurable Processor ◽  
Worst Case Execution Time ◽  
Execution Times ◽  
Hard Real Time ◽  
Time Systems ◽  
Time Bounds

Industrial requires hard real-time systems for safety and critical applications like automotive, Aeronautics, manufacturing control and train industries. Hard Real-Time Systems’ embedded controllers are with expectation of complete the tasks within a certain time bounds reliably including task scheduling. The estimation of upper bound limits corresponding to the execution times is often termed as the Worst-Case Execution Times (WCETs). It is an essential step in developing and validating the hard real-time systems. Particularly, the upper bounds need to satisfy these constraints related to the execution times. However, it is often not feasible many times to set upper bounds on execution times for programs. In present work, the problem of choosing reconfigurable Custom Instructions (CIs) is accomplished by optimizing the WCET corresponding to an application. This issue is designed using Particle Swarm Optimization (PSO) based program for a path analysis. The work emphasizes on the effectiveness of optimizing the WCET when applied to a reconfigurable processor. It evaluates a compound application of multimedia with a host of reconfigurable CIs corresponding to a number of hardware parameters.  

Use of Measurements in Worst-Case Execution Time Estimation for Real-Time Systems

2021 ◽  
Author(s):  
Jessica Junia Santillo Costa ◽  
Romulo Silva de Oliveira ◽  
Luis Fernando Arcaro
Keyword(s):  
Real Time ◽  
Execution Time ◽  
Time Estimation ◽  
Real Time Systems ◽  
Worst Case ◽  
Worst Case Execution Time ◽  
Time Systems

A Method for Simultaneously Satisfying Important Constraints and Dependencies for Many Different Types of Processes in Embedded Real-Time Systems

2011 ◽  
Author(s):  
Jia Xu
Keyword(s):  
Real Time ◽  
Computation Time ◽  
Real Time Systems ◽  
Worst Case ◽  
Release Times ◽  
Different Types ◽  
High Assurance ◽  
Run Time ◽  
Soft Deadline ◽  
Time Systems

In most embedded, real-time applications, processes need to satisfy various important constraints and dependencies, such as release times, offsets, precedence relations, and exclusion relations. Embedded, real-time systems with high assurance requirements often must execute many different types of processes with such constraints and dependencies. Some of the processes may be periodic and some of them may be asynchronous. Some of the processes may have hard deadlines and some of them may have soft deadlines. For some of the processes, especially the hard real-time processes, complete knowledge about their characteristics can and must be acquired before run-time. For other processes, prior knowledge of their worst case computation time and their data requirements may not be available. It is important for many embedded real-time systems to be able to simultaneously satisfy as many important constraints and dependencies as possible for as many different types of processes as possible. In this paper, we discuss what types of important constraints and dependencies can be satisfied among what types of processes. We also present a method which guarantees that, for every process, no matter whether it is periodic or asynchronous, and no matter whether it has a hard deadline or a soft deadline, as long as the characteristics of that process are known before run-time, then that process will be guaranteed to be completed before predetermined time limits, while simultaneously satisfying many important constraints and dependencies with other processes.

scholarly journals Tight Evaluation of Real-Time Task Schedulability for Processor’s DVS and Nonvolatile Memory Allocation

Micromachines ◽  
2019 ◽  
Vol 10 (6) ◽  
pp. 371 ◽  
Author(s):  
Sunhwa Nam ◽  
Kyungwoon Cho ◽  
Hyokyung Bahn
Keyword(s):  
Real Time ◽  
Power Saving ◽  
Random Access ◽  
Random Access Memory ◽  
Voltage Scaling ◽  
Real Time Systems ◽  
Access Memory ◽  
Placement Problem ◽  
Worst Case ◽  
Time Systems

A power-saving approach for real-time systems that combines processor voltage scaling and task placement in hybrid memory is presented. The proposed approach incorporates the task’s memory placement problem between the DRAM (dynamic random access memory) and NVRAM (nonvolatile random access memory) into the task model of the processor’s voltage scaling and adopts power-saving techniques for processor and memory selectively without violating the deadline constraints. Unlike previous work, our model tightly evaluates the worst-case execution time of a task, considering the time delay that may overlap between the processor and memory, thereby reducing the power consumption of real-time systems by 18–88%.

scholarly journals Worst-case execution-time analysis for embedded real-time systems

2003 ◽  
Vol 4 (4) ◽  
pp. 437-455 ◽  
Author(s):  
Jakob Engblom ◽  
Andreas Ermedahl ◽  
Mikael Sjödin ◽  
Jan Gustafsson ◽  
Hans Hansson
Keyword(s):  
Real Time ◽  
Execution Time ◽  
Real Time Systems ◽  
Time Analysis ◽  
Worst Case ◽  
Worst Case Execution Time ◽  
Time Systems

scholarly journals Optimisation of scheduled tasks by real-time measurement and correlation

2020 ◽  
pp. 36-43
Author(s):  
Berkay Saydam ◽  
Cem Orhan ◽  
Niyazi Toker ◽  
Mansur Turasan
Keyword(s):  
Real Time ◽  
Functional Safety ◽  
Worst Case ◽  
System Cost ◽  
Simulation Tools ◽  
Real Time Measurement ◽  
Real Hardware ◽  
Execution Times ◽  
Time Critical ◽  
Time Systems

For functional safety, the scheduler should perform all time critical tasks in an order and within predefined deadlines in embedded systems. Scheduling of time critical tasks is determined by estimating their worst-case execution times. To justify the model design of task scheduling, it is required to simulate and visualise the task execution and scheduling maps. This helps to figure out possible problems before deploying the schedule model to real hardware. The simulation tools which are used by companies in an industry perform scheduling simulation and visualisation of all time critical tasks to design and verify the model. All of them lack the capability of comparing simulation results versus real results to achieve the optimised scheduling design. This sometimes leads the overestimated worst-case execution times and increased system cost. The aim of our study is to decrease the system cost with optimisation of scheduled tasks via using the static analysing method.   Keywords: Schedule visualisation, scheduler optimisation, functional safety, real-time systems, scheduler.

Reconfiguration of Uniprocessor Sporadic Real-Time Systems

2011 ◽  
pp. 167-189 ◽  
Author(s):  
Laurent George ◽  
Pierre Courbin
Keyword(s):  
Sensitivity Analysis ◽  
Real Time ◽  
Performance Tuning ◽  
Real Time Systems ◽  
Software Faults ◽  
Worst Case ◽  
Task Model ◽  
Worst Case Execution Time ◽  
On Line ◽  
Time Systems

In this chapter the authors focus on the problem of reconfiguring embedded real-time systems. Such reconfiguration can be decided either off-line to determine if a given application can be run on a different platform, while preserving the timeliness constraints imposed by the application, or on-line, where a reconfiguration should be done to adapt the system to the context of execution or to handle hardware or software faults. The task model considered in this chapter is the classical sporadic task model defined by a Worst Case Execution Time (WCET), a minimum inter-arrival time (also denoted the minimum Period) and a late termination deadline. The authors consider two preemptive scheduling strategies: Fixed Priority highest priority first (FP) and Earliest Deadline First (EDF). They propose a sensitivity analysis to handle reconfiguration issues. Sensitivity analysis aims at determining acceptable deviations from the specifications of a problem due to evolutions in system characteristics (reconfiguration or performance tuning). They present a state of the art for sensitivity analysis in the case of WCETs, Periods and Deadlines reconfigurations and study to what extent sensitivity analysis can be used to decide on the possibility of reconfiguring a system.

Sign in / Sign up

Export Citation Format

Share Document