Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications

2008 ◽  
Author(s):  
Sanjoy Baruah ◽  
Steve Vestal
Keyword(s):  
Schedulability Analysis ◽  
Sporadic Tasks

scholarly journals Flexible Framework for Statistical Schedulability Analysis of Probabilistic Sporadic Tasks

2015 ◽  
Author(s):  
Abdeldjalil Boudjadar ◽  
Jin Hyun Kim ◽  
Alexandre David ◽  
Kim G. Larsen Marius Mikucionis ◽  
Ulrik Nyman ◽  
...  
Keyword(s):  
Schedulability Analysis ◽  
Sporadic Tasks ◽  
Flexible Framework

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.

Sign in / Sign up

Export Citation Format

Share Document