SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:uu-456929"
 

Search: onr:"swepub:oai:DiVA.org:uu-456929" > Scheduling and anal...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Scheduling and analysis of real-time task graph models with nested locks

Du, He (author)
Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China.
Jiang, Xu (author)
Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China.
Lv, Mingsong (author)
Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China.
show more...
Yang, Tao (author)
Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China.
Wang, Yi (author)
Uppsala universitet,Datorteknik,Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China.
show less...
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
English.
In: Journal of systems architecture. - : Elsevier. - 1383-7621 .- 1873-6165. ; 114
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

Locking protocol
Nested resource sharing
Real-time system
Schedulability analysis

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Du, He
Jiang, Xu
Lv, Mingsong
Yang, Tao
Wang, Yi
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Science ...
Articles in the publication
Journal of syste ...
By the university
Uppsala University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view