Scheduling soft aperiodic tasks in adaptable fixed-priority systems

1996 ◽  
Vol 30 (4) ◽  
pp. 17-28 ◽  
Author(s):  
Jongwoon Lee ◽  
Sungyoung Lee ◽  
Hyungill Kim
Keyword(s):  
Fixed Priority ◽  
Priority Systems ◽  
Aperiodic Tasks

scholarly journals Memory-processor co-scheduling in fixed priority systems

2015 ◽  
Author(s):  
Alessandra Melani ◽  
Marko Bertogna ◽  
Vincenzo Bonifaci ◽  
Alberto Marchetti-Spaccamela ◽  
Giorgio Buttazzo
Keyword(s):  
Fixed Priority ◽  
Priority Systems

Exact response time analysis of fixed priority systems based on sporadic servers

2020 ◽  
Vol 110 ◽  
pp. 101836 ◽  
Author(s):  
Jorge Martinez ◽  
Dakshina Dasari ◽  
Arne Hamann ◽  
Ignacio Sañudo ◽  
Marko Bertogna
Keyword(s):  
Response Time ◽  
Response Time Analysis ◽  
Time Analysis ◽  
Fixed Priority ◽  
Priority Systems

Scheduling Aperiodic Tasks in Fixed-Priority Preemptive Systems

1998 ◽  
Vol 31 (14) ◽  
pp. 61-65
Author(s):  
Kwok-Wa Lam ◽  
Kwok-Hin Chang ◽  
Zhiwei Wang ◽  
Sheung-Lun Hung
Keyword(s):  
Fixed Priority ◽  
Aperiodic Tasks

A Review of Hierarchical Fixed Priority Scheduling

2014 ◽  
Vol 536-537 ◽  
pp. 566-569
Author(s):  
Feng Xiang Zhang
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Priority Scheduling ◽  
Scheduling Policies ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Priority Algorithms ◽  
Priority Systems ◽  
Real Time Applications ◽  
Global And Local

This paper focus on two level hierarchical scheduling where several real-time applications are scheduled by the fixed priority algorithms. The application with its real-time tasks is bound to a server which can be modeled as a sporadic task with special care for the schedulability analysis. Different scheduling policies and servers can be applied for hierarchical fixed priority systems, this paper gives a closer review of schedulability analysis for applications and tasks when the global and local schedulers of a system are 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.

Sign in / Sign up

Export Citation Format

Share Document