scholarly journals RT-Est: Real-Time Operating System for Semi-fixed-Priority Scheduling Algorithms

2011 ◽  
Author(s):  
Hiroyuki Chishiro ◽  
Nobuyuki Yamasaki
Keyword(s):  
Operating System ◽  
Real Time ◽  
Scheduling Algorithms ◽  
Priority Scheduling ◽  
Real Time Operating System ◽  
Fixed Priority ◽  
Fixed Priority Scheduling

scholarly journals Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems

2011 ◽  
Vol 6 (1) ◽  
pp. 187 ◽  
Author(s):  
Doina Zmaranda ◽  
Gianina Gabor ◽  
Daniela Elena Popescu ◽  
Codruta Vancea ◽  
Florin Vancea
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Scheduling Algorithms ◽  
Real Time Systems ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Rate Monotonic ◽  
Real Time Applications ◽  
Time Systems

For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in the literature, starting from static scheduling or cyclic executives which provide very deterministic yet inflexible behaviour, to the so called best-effort scheduling, which facilitates maximum run-time flexibility but allows only probabilistic predictions of run-time performance presenting a non-predictable and nondeterministic solution. Between these two extremes lies fixed priority scheduling algorithms, such as Rate Monotonic, that is not so efficient for real-time purposes but exhibits a predictable approach because scheduling is doing offline and guarantees regarding process deadlines could be obtained using appropriate analysis methods. This paper investigates the use of Rate Monotonic algorithm by making adjustments in order to make it more suitable for real-time applications. The factors that motivate the interest for fixed priority scheduling algorithms such Rate Monotonic when doing with real-time systems lies in its associated analysis that could be oriented in two directions: schedulability analysis and analysis of process interactions. The analyzing process is carried out using a previously implemented framework that allows modelling, simulation and schedulability analysis for a set of real-time system tasks, and some of the results obtained are presented.

Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms

2017 ◽  
Vol 16 (4) ◽  
pp. 1-21 ◽  
Author(s):  
Tianyi Wang ◽  
Soamar Homsi ◽  
Linwei Niu ◽  
Shaolei Ren ◽  
Ou Bai ◽  
...  
Keyword(s):  
Real Time ◽  
Task Partitioning ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling

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