SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Sun Nan)
 

Sökning: WFRF:(Sun Nan) > (2020-2024) > Capacity Augmentati...

Capacity Augmentation Function for Real-Time Parallel Tasks With Constrained Deadlines Under GEDF Scheduling

Sun, Jinghao (författare)
Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116024, Peoples R China
Guan, Nan (författare)
Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
Chang, Shuangshuang (författare)
Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110000, Peoples R China
visa fler...
Li, Feng (författare)
Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110000, Peoples R China
Deng, Qingxu (författare)
Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110000, Peoples R China
Wang, Yi (författare)
Uppsala universitet,Datorteknik
visa färre...
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers (IEEE), 2020
2020
Engelska.
Ingår i: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. - : Institute of Electrical and Electronics Engineers (IEEE). - 0278-0070 .- 1937-4151. ; 39:12, s. 4537-4548
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Capacity augmentation bound (CAB) is a widely used quantitative metric in theoretical analysis for directed acyclic graph (DAG) parallel real-time tasks, which reveals the key factors the schedulability of DAG tasks heavily depending on: the normalized utilization (the ratio of the total utilization to the core numbers) and the tensity (the maximum ratio of task's longest path length to task's deadline). However, CAB requires both factors of a schedulable task system to be capped by the same threshold. A task system with a normalized utilization slightly larger than that threshold but very small tensity, or very smaller normalized utilization but slightly larger than that threshold has good chance to be scheduled are both denied by CAB. To this end, we propose a new concept called capacity augmentation function (CAF) to better characterize the schedulability of parallel real-time tasks, which provides a more loose and different threshold for both factors. In particular, we derive a CAF-based linear-time schedulability test for real-time constrained-deadline DAG tasks under global EDF, which entirely dominates the state-of-the-art CAB-based test for constrained-deadline settings. Finally, we conduct experiments to compare the acceptance ratio of our CAF-based test with the existing schedulability tests also having linear-time complexity. The results show that CAF-based test significantly outperforms the existing linear-time schedulability test under different parameter settings.

Ämnesord

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

Nyckelord

Task analysis
Optimal scheduling
Real-time systems
Scheduling
Measurement
Scheduling algorithms
Schedules
Capacity augmentation function (CAF)
constrained deadline
directed acyclic graph (DAG)
global EDF (GEDF)
schedulability

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför 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 Stäng

Kopiera och spara länken för att återkomma till aktuell vy