scholarly journals End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks

2011 ◽  
Author(s):  
Abusayeed Saifullah ◽  
You Xu ◽  
Chenyang Lu ◽  
Yixin Chen
Keyword(s):  
Delay Analysis ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
End To End Delay ◽  
End To End

End-to-end response time with fixed priority scheduling: trajectory approach versus holistic approach

2005 ◽  
Vol 18 (1) ◽  
pp. 37-56 ◽  
Author(s):  
Steven Martin ◽  
Pascale Minet ◽  
Laurent George
Keyword(s):  
Response Time ◽  
Holistic Approach ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Trajectory Approach ◽  
End To End

A Stochastic Network Calculus Approach for the End-to-End Delay Analysis of LTE Networks

2012 ◽  
Vol 35 (1) ◽  
pp. 46-52 ◽  
Author(s):  
Xin CHEN ◽  
Lei ZHANG ◽  
Xu-Dong XIANG ◽  
Jian-Xiong WAN
Keyword(s):  
Delay Analysis ◽  
Network Calculus ◽  
Stochastic Network ◽  
Lte Networks ◽  
End To End Delay ◽  
End To End ◽  
Stochastic Network Calculus

Harmonicity-Aware Task Partitioning for Fixed Priority Scheduling of Probabilistic Real-Time Tasks on Multi-Core Platforms

2017 ◽  
Vol 16 (4) ◽  
pp. 1-21 ◽  
Author(s):  
Tianyi Wang ◽  
Soamar Homsi ◽  
Linwei Niu ◽  
Shaolei Ren ◽  
Ou Bai ◽  
...  
Keyword(s):  
Real Time ◽  
Task Partitioning ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling

A Review of Sufficient Schedulability Analysis for Fixed Priority Scheduling Systems

2015 ◽  
Vol 741 ◽  
pp. 856-859
Author(s):  
Yan Feng Zhai ◽  
Feng Xiang Zhang
Keyword(s):  
Schedulability Analysis ◽  
Priority Assignment ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Rate Monotonic ◽  
Simple Implementation ◽  
Deadline Monotonic ◽  
Activation Rates

This papercarries out a survey of sufficient schedulability analysis forfixed priority (FP) scheduling. The most common used fixed priority assignment is the rate monotonic (RM) algorithm, according to its policy, the task priorities are ordered based on their activation rates, so that the task with the shortest period is assigned the highest priority. However, when each task’s relative deadline is not equal to its period, the RM algorithm is not suitable to assign the task priorities. When relative deadlines are less than or equal to periods,the deadline monotonic (DM) algorithm can be deployed to schedule the tasks. The utilization based schedulability analysis has the advantage of simple implementation, and manyexisting schedulability analyses on uniprocessor are covered.

Sign in / Sign up

Export Citation Format

Share Document