Optimal deadline assignment for periodic real-time tasks in dynamic priority systems

2006 ◽  
Author(s):  
P. Balbastre ◽  
I. Ripoll ◽  
A. Crespo
Keyword(s):  
Real Time ◽  
Dynamic Priority ◽  
Priority Systems

Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems

2008 ◽  
Vol 57 (1) ◽  
pp. 96-109 ◽  
Author(s):  
Patricia Balbastre ◽  
Ismael Ripoll ◽  
Alfons Crespo
Keyword(s):  
Real Time ◽  
Dynamic Priority ◽  
Priority Systems

scholarly journals Dynamic Priority Based Reliable Real-Time Communications for Infrastructure-Less Networks

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 67338-67359 ◽  
Author(s):  
Mohsin Raza ◽  
Hoa Le-Minh ◽  
Nauman Aslam ◽  
Sajjad Hussain ◽  
Muhammad Ali Imran ◽  
...  
Keyword(s):  
Real Time ◽  
Dynamic Priority

scholarly journals Dynamic approach to minimize overhead and response time in scheduling periodic real-time tasks

2021 ◽  
Vol 8 (4) ◽  
pp. 75-81
Author(s):  
Ahmed A. Alsheikhy ◽  
Keyword(s):  
Response Time ◽  
Real Time ◽  
Periodic Tasks ◽  
Dynamic Priority ◽  
New Novel ◽  
Context Switching ◽  
Novel Approach ◽  
Efficiency And Effectiveness ◽  
Time Systems ◽  
The Given

In real-time systems, a task or a set of tasks needs to be executed and completed successfully within a predefined time. Those systems require a scheduling technique or a set of scheduling methods to distribute the given task or the set of tasks among different processors or on a processor. In this paper, a new novel scheduling approach to minimize the overhead from context switching between several periodic tasks is presented. This method speeds up a required response time while ensuring that all tasks meet their deadline times and there is no deadline miss occurred. It is a dynamic-priority technique that works either on a uniprocessor or several processors. In particular, it is proposed to be applied on multiprocessor environments since many applications run on several processors. Various examples are presented within this paper to demonstrate its optimality and efficiency. In addition, several comparison experiments with an earlier version of this approach were performed to demonstrate its efficiency and effectiveness too. Those experiments showed that this novel approach sped up the execution time from 15% to nearly around 46%. In addition, it proved that it reduced the number of a context switch between tasks from 12% to around 50% as shown from simulation tests. Furthermore, this approach delivered all tasks/jobs successfully and ensured there was no deadline miss happened.

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.

Sign in / Sign up

Export Citation Format

Share Document