Sökning: onr:"swepub:oai:DiVA.org:uu-420814" >
Real-Time Schedulin...
Real-Time Scheduling and Analysis of OpenMP DAG Tasks Supporting Nested Parallelism
-
- 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.
-
- Li, Feng (författare)
- Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110004, Peoples R China.
-
visa fler...
-
- Gao, Huimin (författare)
- Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110004, Peoples R China.
-
- Shi, Chang (författare)
- Northeastern Univ, Sch Comp Sci & Engn, Shenyang 110004, Peoples R China.
-
- Wang, Yi (författare)
- Uppsala universitet,Institutionen för informationsteknologi
-
visa färre...
-
Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116024, Peoples R China Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China. (creator_code:org_t)
- IEEE COMPUTER SOC, 2020
- 2020
- Engelska.
-
Ingår i: IEEE Transactions on Computers. - : IEEE COMPUTER SOC. - 0018-9340 .- 1557-9956. ; 69:9, s. 1335-1348
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- OpenMP is a promising framework to develop parallel real-time software on multi-cores. Although similar to the DAG task model, OpenMP task systems are significantly more difficult to analyze due to constraints posed by OpenMP specifications. One of the most interesting features in OpenMP is the support for nested parallelism, enjoying benefits in enhancing performance transparency of parallel libraries and promoting reuse of black-box code. Previous researches on DAG task scheduling mainly restrict to only one level of parallelism. The problem whether OpenMP tasks with multiple levels of parallelism are suitable to real-time systems remains open. In this paper, we study the real-time scheduling and analysis of OpenMP task systems supporting nested parallelism. First, we show that under existing scheduling algorithms in OpenMP implementations, nested parallelism indeed may lead to extremely bad timing behaviors where the parallel workload is sequentially executed completely. To solve this problem, we propose a new scheduling algorithm and develop two sound response time bounds by considering the trade-off between simplicity and analysis precision. Experiments demonstrate the efficiency of our methods.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Task analysis
- Parallel processing
- Time factors
- Real-time systems
- Libraries
- Runtime
- Synchronization
- OpenMP
- directed acyclic graph (DAG)
- nested parallel
- response time analysis
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas