scholarly journals Schedulability analysis for a combination of non-preemptive strict periodic tasks and preemptive sporadic tasks

2012 ◽  
Author(s):  
Mohamed Marouf ◽  
Laurent George ◽  
Yves Sorel
Keyword(s):  
Schedulability Analysis ◽  
Sporadic Tasks ◽  
Periodic Tasks

scholarly journals Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks

2021 ◽  
Vol 20 (1) ◽  
pp. 1-26
Author(s):  
Paolo Pazzaglia ◽  
Youcheng Sun ◽  
Marco Di Natale
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Periodic Tasks ◽  
Time Periodic

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 for Strictly Periodic Tasks in RTOS

2018 ◽  
Vol 44 (3) ◽  
pp. 159-169 ◽  
Author(s):  
S. A. Zelenova ◽  
S. V. Zelenov
Keyword(s):  
Schedulability Analysis ◽  
Periodic Tasks

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.

New Optimal Preemptively Scheduling for Real-Time Reconfigurable Sporadic Tasks Based on Earliest Deadline First Algorithm

2012 ◽  
Vol 4 (2) ◽  
pp. 65-81 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Mohamed Khalgui ◽  
Samir Ben Ahmed
Keyword(s):  
Response Time ◽  
Real Time ◽  
Dynamic Scheduling ◽  
Optimal Algorithm ◽  
Real Life ◽  
Sporadic Tasks ◽  
Periodic Tasks ◽  
Worst Case ◽  
Utilization Factor ◽  
Earliest Deadline

This paper examines the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on uniprocessor in a hard real-time environment. The authors introduce an optimal earliest deadline scheduling algorithm to optimize response time while ensuring that all periodic tasks meet their deadlines and to accept as many sporadic tasks. A necessary and sufficient schedulability test is presented, and an efficient O(n+m) guarantee algorithm is proposed. This optimal algorithm results in dynamic scheduling solutions. They are presented by a proposed intelligent agent-based architecture where a software agent is used to evaluate the response time, to calculate the processor utilization factor and also to verify the satisfaction of real-time deadlines. The agent dynamically provides technical solutions for users where the system becomes unfeasible by sending sporadic tasks to idle times, by modifying the deadlines of tasks, the worst case execution times (WCETs), the activation time, by tolerating some non critical tasks according to the (m, n) firm and a reasonable cost, or in the worst case by removing some non hard (soft) tasks according to predefined heuristic. The authors implement the agent to support these services which are applied to extensive experiments with real-life design examples in order to demonstrate the effectiveness and the excellent performance of the new optimal algorithm in normal and overload conditions.

The Algorithms of Dynamic Servers for Scheduling Aperiodic Real-Time Tasks – A Review

2014 ◽  
Vol 945-949 ◽  
pp. 3380-3383
Author(s):  
Feng Xiang Zhang
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Schedulability Analysis ◽  
Periodic Tasks ◽  
Dynamic Algorithms ◽  
Fixed Priority ◽  
Aperiodic Tasks ◽  
Hard Real Time

This paper focus on the dynamic server algorithms, and the servers are used for scheduling soft aperiodic tasks. Many types of servers and their schedulability analysis are reviewed, these properties can be used for constructing hierarchical embedded systems, where the soft aperiodic tasks and the hard real-time tasks can be scheduled in the same system. The aperiodic tasks in the server are not preemptable, and they are executed in a first-come first-served (FCFS) manner. If it is not specified, there is only one server in the system, and rest of the processes in the system are ordinary periodic tasks. The servers could be scheduled by fixed priority or dynamic algorithms.

Sign in / Sign up

Export Citation Format

Share Document