id:"swepub:oai:DiVA.org:uu-351171"
Search: id:"swepub:oai:DiVA.org:uu-351171" > Semi-Federated Sche...
- 1 of 1
- Previous record
- Next record
- To hitlist
Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors
-
- Jiang, Xu (author)
- Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China.;Beihang Univ, Sch Comp Sci & Engn, State Key Lab Virtual Real Technol & Syst, Beijing, Peoples R China.
-
- Guan, Nan (author)
- Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China.
-
- Long, Xiang (author)
- Beihang Univ, Sch Comp Sci & Engn, State Key Lab Virtual Real Technol & Syst, Beijing, Peoples R China.
- show more...
- show less...
- Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China;Beihang Univ, Sch Comp Sci & Engn, State Key Lab Virtual Real Technol & Syst, Beijing, Peoples R China. Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China. (creator_code:org_t)
- IEEE, 2017
- 2017
- English.
- In: 2017 IEEE Real-Time Systems Symposium (RTSS). - : IEEE. - 9781538614143 ; , s. 80-91
- Conference paper (peer-reviewed)
Abstract
Subject headings
Close
- Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the remaining processors. However, federated scheduling suffers resource waste since a heavy task with processing capacity requirement x + is an element of (where x is an integer and 0 < is an element of < 1) needs x+ 1 dedicated processors. In the extreme case, almost half of the processing capacity is wasted. In this paper we propose the semi-federate scheduling approach, which only grants x dedicated processors to a heavy task with processing capacity requirement x+ is an element of, and schedules the remaining is an element of part together with light tasks on shared processors. Experiments with randomly generated task sets show the semi-federated scheduling approach significantly outperforms not only federated scheduling, but also all existing approaches for scheduling parallel real-time tasks on multi-cores.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- real-time-scheduling
- parallel-tasks
- DAG
- federated-scheduling
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
- 2017 IEEE Real-Time Systems Symposium (RTSS) (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Jiang, Xu
- Guan, Nan
- Long, Xiang
- Yi, Wang
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
- Articles in the publication
- 2017 IEEE Real-T ...
- 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
