Skip to search formSkip to main contentSkip to account menu

Scheduling analysis real-time systems

Known as: Sheduling analysis real-time systems 
The term scheduling analysis in real-time computing includes the analysis and testing of the scheduler system and the algorithms used in real-time… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The assignment of scheduling parameters under the Earliest Deadline First (EDF) scheduling policy is trivial in single processor… 
Highly Cited
2010
Highly Cited
2010
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970's… 
2010
2010
In this paper, we study thermal-constrained hard real-time systems, where real-time guarantees must be met without exceeding safe… 
Highly Cited
2009
Highly Cited
2009
Thermal management becomes a prominent issue in system design for both server systems and embedded systems. A system could fail… 
Highly Cited
2006
Highly Cited
2006
Embedded systems are complex as a whole but consist of smaller independent modules minimally interacting with each other. This… 
2005
2005
Unlike preemptive scheduling policies, non-preemptive real-time scheduling policies can exhibit anomalies even for the single… 
Highly Cited
2004
Highly Cited
2004
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with… 
1995
1995
Due to the critical nature of real-time systems, there is an ever growing burden on the designer to not only guarantee that the… 
1993
1993
The paper develops a generalized approach to schedulability analysis that is mathematically founded in a process algebra called… 
1992
1992
Hard real time systems need schedulability analysis to check that timing constraints are met before the actual application is run…