An ILP-based Worst-case Performance Analysis Technique for Distributed Real-time Embedded Systems

2012 ◽  
Author(s):  
Jinwoo Kim ◽  
Hyunok Oh ◽  
Hyojin Ha ◽  
Shin-Haeng Kang ◽  
Junchul Choi ◽  
...  
Keyword(s):  
Performance Analysis ◽  
Embedded Systems ◽  
Real Time ◽  
Worst Case ◽  
Analysis Technique

Efficiently Handling Process Overruns and Underruns on Multiprocessors in Real-Time Embedded Systems

2017 ◽  
Author(s):  
Jia Xu
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Time Complexity ◽  
Multiprocessor System ◽  
Multiprocessor Systems ◽  
Worst Case ◽  
Real World Applications ◽  
Run Time ◽  
Hard Real Time ◽  
Time Overhead

In hard real-time and embedded multiprocessor system real-world applications, it is very important to strive to minimize the run-time overhead of the scheduler as much as possible, especially in hard real-time and embedded multiprocessor systems with limited processor and system resources. In this paper, we present a method that reduces the worst-case time complexity of the run-time scheduler for re-computing latest start times and for selecting processes for execution on a multiprocessor at run-time to O(n), where n is the number of processes.

An Overview of Worst-Case Execution Time Estimation for Embedded Programs

2014 ◽  
Vol 651-653 ◽  
pp. 624-629
Author(s):  
Liang Liang Kong ◽  
Lin Xiang Shi ◽  
Lin Chen
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Execution Time ◽  
Time Estimation ◽  
Worst Case ◽  
Performance Metric ◽  
Worst Case Execution Time ◽  
Hard Real Time ◽  
Time Systems

Most embedded systems are real-time systems, so real-time is an important performance metric for embedded systems. The worst-case execution time (WCET) estimation for embedded programs could satisfy the requirement of hard real-time evaluation, so it is widely used in embedded systems evaluation. Based on sufficient survey on the progress of WCET estimation around the world, it proposes a new classification of WCET estimation. After introducing the principle of WCET estimation, it mainly demonstrates various types of technologies to estimate WCET and classifies them into two main streams, namely, static and dynamic WCET estimations. Finally, it shows the development of WCET analysis tools.

Efficiently Handling Process Overruns and Underruns in Real-Time Embedded Systems

2015 ◽  
Author(s):  
Jia Xu
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Time Process ◽  
Time System ◽  
Worst Case ◽  
Real Time System ◽  
System Utilization ◽  
System Overhead ◽  
Run Time

Methods for handling process underruns and overruns when scheduling a set of real-time processes increase both system utilization and robustness in the presence of inaccurate estimates of the worst-case computations of real-time processes. In this paper, we present a method that efficiently re-computes latest start times for real time processes during run-time in the event that a real-time process is preempted or has completed (or overrun). The method effectively identifies which process latest start times will be affected by the preemption or completion of a process. Hence the method is able to effectively reduce real-time system overhead by selectively re-computing latest start times for the specific processes whose latest start times are changed by a process preemption or completion, as opposed to indiscriminately re-computing latest start times for all the processes.

scholarly journals A Group-Based Energy-Efficient Dual Priority Scheduling for Real-Time Embedded Systems

Information ◽  
2020 ◽  
Vol 11 (4) ◽  
pp. 191
Author(s):  
Yongqi Ge ◽  
Rui Liu
Keyword(s):  
Energy Consumption ◽  
Embedded Systems ◽  
Real Time ◽  
System Reliability ◽  
Energy Efficient ◽  
Worst Case ◽  
Priority Scheduling ◽  
Different Types ◽  
Time Overhead ◽  
Case Response

As the limitation of energy consumption of real-time embedded systems becomes more and more strict, it has been difficult to ignore the time overhead and energy consumption of context switches for fixed-priority tasks with preemption scheduling (FPP) in multitasking environments. In addition, the scheduling for different types of tasks may disrupt each other and affect system reliability. A group-based energy-efficient dual priority scheduling (GEDP) is proposed in this paper. The GEDP isolates different types of tasks to avoid the disruption. Furthermore, it also reduces context switches effectively, thus decreasing system energy consumption. As many studies ignored the context switches’ overhead in the worst-case response time (WCRT) model, and it will affect the accuracy of WCRT, thereby affecting the system schedulability. Consequently, the WCRT model is improved based on considering context switches’ overhead. The GEDP is designed and implemented in Linux, and the time overhead and energy consumption of context switches is compared in different situations with GEDP and FPP. The experimental results show that GEDP can reduce context switches by about 1% and decrease energy consumption by about 0.6% for given tasks.

Sign in / Sign up

Export Citation Format

Share Document