An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks

2019 ◽  
Author(s):  
Beyazit Yalcinkaya ◽  
Mitra Nasri ◽  
Bjorn B. Brandenburg
Keyword(s):  
Real Time ◽  
Schedulability Test

scholarly journals A new sufficient schedulability analysis for hybrid scheduling

2016 ◽  
Vol 26 (3) ◽  
pp. 683-692 ◽  
Author(s):  
Fengxiang Zhang ◽  
Yanfeng Zhai ◽  
Jianwei Liao
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Real Time Systems ◽  
Hybrid Scheduling ◽  
Acceptance Ratio ◽  
Schedulability Test ◽  
Time Systems ◽  
Task Systems ◽  
Task Parameters ◽  
Earliest Deadline

Abstract Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.

scholarly journals Survey on Optimal Schedulability Test for Hard Real Time Scheduling

IJARCCE ◽  
2015 ◽  
Vol 4 (5) ◽  
pp. 746-753
Author(s):  
Nitin C. Patil ◽  
Prof. Dhanure S. P
Keyword(s):  
Real Time ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Schedulability Test ◽  
Hard Real Time
Sign in / Sign up

Export Citation Format

Share Document