Deterministic preemptive scheduling of real-time tasks

Computer ◽  
2002 ◽  
Vol 35 (5) ◽  
pp. 72-79 ◽  
Author(s):  
L.E. Jackson ◽  
G.N. Rouskas
Keyword(s):  
Real Time ◽  
Preemptive Scheduling

scholarly journals Towards Fully Jitterless Applications: Periodic Scheduling in Multiprocessor MCSs Using a Table-Driven Approach

2020 ◽  
Vol 10 (19) ◽  
pp. 6702
Author(s):  
Eugenia Ana Capota ◽  
Cristina Sorina Stangaciu ◽  
Mihai Victor Micea ◽  
Daniel-Ioan Curiac
Keyword(s):  
Real Time ◽  
Multiprocessor Systems ◽  
Preemptive Scheduling ◽  
Algorithm Performance ◽  
Safety Critical ◽  
Time Table ◽  
Scheduling Method ◽  
Embedded Applications ◽  
Special Case ◽  
Mixed Criticality

In mixed criticality systems (MCSs), the time-triggered scheduling approach focuses on a special case of safety-critical embedded applications which run in a time-triggered environment. Sometimes, for these types of MCSs, perfectly periodical (i.e., jitterless) scheduling for certain critical tasks is needed. In this paper, we propose FENP_MC (Fixed Execution Non-Preemptive Mixed Criticality), a real-time, table-driven, non-preemptive scheduling method specifically adapted to mixed criticality systems which guarantees jitterless execution in a mixed criticality time-triggered environment. We also provide a multiprocessor version, namely, P_FENP_MC (Partitioned Fixed Execution Non-Preemptive Mixed Criticality), using a partitioning heuristic. Feasibility tests are proposed for both uniprocessor and homogenous multiprocessor systems. An analysis of the algorithm performance is presented in terms of success ratio and scheduling jitter by comparing it against a time-triggered and an event-driven method in a non-preemptive context.

Sign in / Sign up

Export Citation Format

Share Document