Energy-efficient fixed-priority scheduling for real-time systems based on threshold work-demand analysis

2011 ◽  
Author(s):  
Linwei Niu ◽  
Wei Li
Keyword(s):  
Real Time ◽  
Energy Efficient ◽  
Demand Analysis ◽  
Real Time Systems ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Work Demand ◽  
Fixed Priority Scheduling ◽  
Time Systems

Energy-Efficient Scheduling for Embedded Real-Time Systems Using Threshold Work-Demand Analysis

2017 ◽  
Vol 26 (06) ◽  
pp. 1750091 ◽  
Author(s):  
Linwei Niu ◽  
Wei Li
Keyword(s):  
Energy Saving ◽  
Real Time ◽  
Energy Efficient ◽  
Critical Speed ◽  
Demand Analysis ◽  
Real Time Systems ◽  
Work Demand ◽  
Hard Real Time ◽  
Time Systems ◽  
Earliest Deadline

In this paper, we study the problem of reducing the energy consumption for hard real-time systems scheduled according to either fixed-priority (FP) or earliest-deadline-first (EDF) scheme. To balance the static and dynamic energy consumptions, the concept of critical speed was proposed in previous research. Moreover, when combined with the processor idle/shutdown state, the critical speed was widely used as the lower bound for voltage scaling in literature. In this paper, we show that this strategy might not always be more energy efficient than the traditional DVS strategy and there exists a dynamic tradeoff between these two strategies depending on the job’s work-demand to be finished within certain intervals. To effectively address this issue, we propose a unified approach that combines these two strategies to achieve better overall energy saving performance. Our approach determines the energy-efficient speeds for real-time jobs in their corresponding feasible intervals based on the threshold work-demand analysis. Our experimental results demonstrate that the proposed techniques significantly outperform previous approaches in the overall energy saving performance.

Global Fixed Priority Scheduling with Constructing Execution Dependency in Multiprocessor Real-Time Systems

2018 ◽  
Vol 27 (10) ◽  
pp. 1850165
Author(s):  
Meiling Han ◽  
Tianyu Zhang ◽  
Yuhan Lin ◽  
Zhiwei Feng ◽  
Qingxu Deng
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Analysis Method ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Lower Priority ◽  
Acceptance Ratio ◽  
Processor Performance ◽  
Time Systems

The increasing demands for processor performance are driving system designers to adopt multiprocessors. In this paper, we study global fixed priority scheduling in multiprocessor real-time systems and introduce a technique for improving the schedulability. The key idea is to construct execution dependency for selected tasks to leverage slack time and reduce the interference between high-priority and low-priority tasks. Thus, more lower-priority tasks are enabled to be scheduled. Further, we provide a response time analysis method which takes the execution constraint of tasks into consideration. Extensive simulation results indicate that the proposed approach outperforms existing work in terms of acceptance ratio.

Fixed-priority scheduling of real-time systems using utilization bounds

1996 ◽  
Vol 33 (1) ◽  
pp. 57-63 ◽  
Author(s):  
Dong-Won Park ◽  
Swaminathan Natarajan ◽  
Arkady Kanevsky
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Time Systems

Execution allowance based fixed priority scheduling for probabilistic real-time systems

2019 ◽  
Vol 152 ◽  
pp. 120-133 ◽  
Author(s):  
Jiankang Ren ◽  
Zichuan Xu ◽  
Chao Yu ◽  
Chi Lin ◽  
Guowei Wu ◽  
...  
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document