Modeling Device Driver Effects in Real-Time Schedulability Analysis: Study of a Network Driver

2007 ◽  
Author(s):  
Mark Lewandowski ◽  
Mark J. Stanovich ◽  
Theodore P. Baker ◽  
Kartik Gopalan ◽  
An-I Andy Wang
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Device Driver ◽  
Analysis Study

scholarly journals Modeling and schedulability analysis in the development of real-time distributed Ada systems

2002 ◽  
Author(s):  
J. Javier Gutiérrez ◽  
José M. Drake ◽  
Michael González Harbour ◽  
Julio L. Medina
Keyword(s):  
Real Time ◽  
Schedulability Analysis

scholarly journals Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks

2021 ◽  
Vol 20 (1) ◽  
pp. 1-26
Author(s):  
Paolo Pazzaglia ◽  
Youcheng Sun ◽  
Marco Di Natale
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Periodic Tasks ◽  
Time Periodic

scholarly journals Logic-based schedulability analysis for compositional hard real-time embedded systems

2015 ◽  
Vol 12 (1) ◽  
pp. 56-64 ◽  
Author(s):  
André de Matos Pedro ◽  
David Pereira ◽  
Luís Miguel Pinho ◽  
Jorge Sousa Pinto
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Schedulability Analysis ◽  
Hard Real Time

Schedulability Analysis for Timed Automata With Tasks

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-26
Author(s):  
Jinghao Sun ◽  
Nan Guan ◽  
Rongxiao Shi ◽  
Guozhen Tan ◽  
Wang Yi
Keyword(s):  
Model Checking ◽  
State Space ◽  
Real Time ◽  
Timed Automata ◽  
Schedulability Analysis ◽  
Scheduling Theory ◽  
Real Time Scheduling ◽  
Analysis Techniques ◽  
Model Complex ◽  
Time Scheduling

Research on modeling and analysis of real-time computing systems has been done in two areas, model checking and real-time scheduling theory. In model checking, an expressive modeling formalism such as timed automata (TA) is used to model complex systems, but the analysis is typically very expensive due to state-space explosion. In real-time scheduling theory, the analysis techniques are highly efficient, but the models are often restrictive. In this paper, we aim to exploit the possibility of applying efficient analysis techniques rooted in real-time scheduling theory to analysis of real-time task systems modeled by timed automata with tasks (TAT). More specifically, we develop efficient techniques to analyze the feasibility of TAT-based task models (i.e., whether all tasks can meet their deadlines on single-processor) using demand bound functions (DBF), a widely used workload abstraction in real-time scheduling theory. Our proposed analysis method has a pseudo-polynomial time complexity if the number of clocks used to model each task is bounded by a constant, which is much lower than the exponential complexity of the traditional model-checking based analysis approach (also assuming the number of clocks is bounded by a constant). We apply dynamic programming techniques to implement the DBF-based analysis framework, and propose state space pruning techniques to accelerate the analysis process. Experimental results show that our DBF-based method can analyze a TAT system with 50 tasks within a few minutes, which significantly outperforms the state-of-the-art TAT-based schedulability analysis tool TIMES.

Integrating Schedulability Analysis and SDL in an Object-Oriented Methodology for Embedded Real-time Systems

SDL '99 ◽  
1999 ◽  
pp. 241-256 ◽  
Author(s):  
J.M. Alvarez ◽  
M. Díaz ◽  
L.M. Llopis ◽  
E. Pimentel ◽  
J.M. Troya
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Object Oriented ◽  
Real Time Systems ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document