Sökning: onr:"swepub:oai:DiVA.org:uu-457471" >
Schedulability Anal...
Schedulability Analysis for Timed Automata With Tasks
-
- Sun, Jinghao (författare)
- Dalian Univ Technol, 2 Linggong Rd, Dalian 116024, Liaoning, Peoples R China.
-
- Guan, Nan (författare)
- City Univ Hong Kong, Kowloon, Tat Chee Ave, Hong Kong 999077, Peoples R China.
-
- Shi, Rongxiao (författare)
- Northeastern Univ, 11,Lane 3,Wenhua Rd, Shenyang 110819, Liaoning, Peoples R China.
-
visa fler...
-
- Tan, Guozhen (författare)
- Dalian Univ Technol, 2 Linggong Rd, Dalian 116024, Liaoning, Peoples R China.
-
- Wang, Yi (författare)
- Uppsala universitet,Datorteknik
-
visa färre...
-
Dalian Univ Technol, 2 Linggong Rd, Dalian 116024, Liaoning, Peoples R China City Univ Hong Kong, Kowloon, Tat Chee Ave, Hong Kong 999077, Peoples R China. (creator_code:org_t)
- 2021-09-22
- 2021
- Engelska.
-
Ingår i: ACM Transactions on Embedded Computing Systems. - : Association for Computing Machinery (ACM). - 1539-9087 .- 1558-3465. ; 20:5s
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Engineering (hsv//eng)
Nyckelord
- Timed automata
- schedulability test
- demand bound function
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas