Fixed-Priority Schedulability of Arbitrary-Deadline Sporadic Tasks upon Periodic Resources

2012 ◽  
Author(s):  
Farhana Dewan ◽  
Nathan Fisher
Keyword(s):  
Sporadic Tasks ◽  
Fixed Priority

Schedulability Analysis of Fixed Priority Servers for Scheduling Aperiodic Real-Time Tasks – A Review

2014 ◽  
Vol 651-653 ◽  
pp. 1933-1936
Author(s):  
Feng Xiang Zhang
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Timing Constraints ◽  
Sporadic Tasks ◽  
Fixed Priority ◽  
Rate Monotonic ◽  
Aperiodic Tasks ◽  
Deadline Monotonic ◽  
Priority Algorithm

This paper focus on the schedulability analysis of fixed priority servers. A number of fixed priority servers and their schedulability analysis are reviewed, these results and properties can be used for constructing systems with different timing constraints, where real-time tasks with hard deadlines and the soft aperiodic tasks can be scheduled in the same system. The aperiodic tasks in the fixed priority servers are not preemptable, and they are scheduled in a first-come first-served manner. There is only one server with many periodic or sporadic tasks in the system. The tasks and the server are scheduled by a fixed priority algorithm such as rate monotonic or deadline monotonic.

scholarly journals Timing Analysis of Fixed Priority Self-Suspending Sporadic Tasks

2015 ◽  
Author(s):  
Geoffrey Nelissen ◽  
Jose Fonseca ◽  
Gurulingesh Raravi ◽  
Vincent Nelis
Keyword(s):  
Timing Analysis ◽  
Sporadic Tasks ◽  
Fixed Priority

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
Sign in / Sign up

Export Citation Format

Share Document