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

Du, HeNortheastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China. (författare)

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.

Jiang, XuNortheastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China. (författare)
Lv, MingsongNortheastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China. (författare)
Yang, TaoNortheastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China. (författare)
Wang, YiUppsala universitet,Datorteknik,Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China.(Swepub:uu)wangyi (författare)
Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China.Northeastern Univ, 11 Wenhua St, Shenyang, Liaoning, Peoples R China. (creator_code:org_t)

Av författaren/redakt...: Du, He; Jiang, Xu; Lv, Mingsong; Yang, Tao; Wang, Yi

Om ämnet

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.