scholarly journals Contracts for Schedulability Analysis

Author(s):  
Philipp Reinkemeier ◽  
Albert Benveniste ◽  
Werner Damm ◽  
Ingo Stierand
2002 ◽  
Author(s):  
J. Javier Gutiérrez ◽  
José M. Drake ◽  
Michael González Harbour ◽  
Julio L. Medina

2021 ◽  
Vol 20 (1) ◽  
pp. 1-26
Author(s):  
Paolo Pazzaglia ◽  
Youcheng Sun ◽  
Marco Di Natale

2015 ◽  
Vol 741 ◽  
pp. 856-859
Author(s):  
Yan Feng Zhai ◽  
Feng Xiang Zhang

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.


2015 ◽  
Vol 12 (1) ◽  
pp. 56-64 ◽  
Author(s):  
André de Matos Pedro ◽  
David Pereira ◽  
Luís Miguel Pinho ◽  
Jorge Sousa Pinto

Sign in / Sign up

Export Citation Format

Share Document