WFRF:(Sun Nan)
Search: WFRF:(Sun Nan) > (2020-2024) > Capacity Augmentati...
- 17 of 30
- Previous record
- Next record
- To hitlist
Capacity Augmentation Function for Real-Time Parallel Tasks With Constrained Deadlines Under GEDF Scheduling
-
- Sun, Jinghao (author)
- Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116024, Peoples R China
-
- Guan, Nan (author)
- Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
-
- Chang, Shuangshuang (author)
- Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110000, Peoples R China
- show more...
- show less...
- (creator_code:org_t)
- Institute of Electrical and Electronics Engineers (IEEE), 2020
- 2020
- English.
- In: 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
- Journal article (peer-reviewed)
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- 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
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (Search for host publication in LIBRIS)
To the university's database
- 17 of 30
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Sun, Jinghao
- Guan, Nan
- Chang, Shuangshu ...
- Li, Feng
- Deng, Qingxu
- Wang, Yi
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
- Articles in the publication
- IEEE Transaction ...
- By the university
- Uppsala University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
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.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
