Fixed Priority Scheduling Theory for Hard Real-Time Systems

1991 ◽  
pp. 1-30 ◽  
Author(s):  
John P. Lehoczky ◽  
Lui Sha ◽  
J. K. Strosnider ◽  
Hide Tokuda
Keyword(s):  
Real Time ◽  
Scheduling Theory ◽  
Real Time Systems ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Hard Real Time ◽  
Time Systems

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.

Sign in / Sign up

Export Citation Format

Share Document