Sökning: onr:"swepub:oai:DiVA.org:uu-456929" >
Scheduling and anal...
Scheduling and analysis of real-time task graph models with nested locks
-
- Du, He (författare)
- Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China.
-
- Jiang, Xu (författare)
- Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China.
-
- Lv, Mingsong (författare)
- Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China.
-
visa fler...
-
- Yang, Tao (författare)
- Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China.
-
- Wang, Yi (författare)
- Uppsala universitet,Datorteknik,Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China.
-
visa färre...
-
Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China. (creator_code:org_t)
- Elsevier, 2021
- 2021
- Engelska.
-
Ingår i: Journal of systems architecture. - : Elsevier. - 1383-7621 .- 1873-6165. ; 114
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Locking protocol is a crucial component in scheduling of real-time systems. The digraph real-time task model (DRT) is the state-of-the-art graph-based task model, which is a generalization of most previous real-time task models. To our best knowledge, the only work addressing resource sharing problem in DRT task model proposes a resource sharing protocol, called ACP, as well as a scheduling strategy EDF+ACP. Although EDF+ACP is optimal for scheduling DRT tasks with non-nested resource access, it cannot handle the situation of nested resource accesses. In this paper, we propose a new protocol, called N-ACP, by modifying ACP to manage nested resource accesses in task graph models. We apply N-ACP to EDF scheduling to obtain a new scheduling strategy EDF+N-ACP. We develop schedulability analysis techniques for EDF+N-ACP and evaluate its performance by a widely-used quantitative metrics speedup factor. We derive its speedup factor as a function of the maximal nesting level of resource accesses in the system.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Locking protocol
- Nested resource sharing
- Real-time system
- Schedulability analysis
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas