uu.seUppsala universitets publikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Real-Time Scheduling and Analysis of OpenMP Task Systems with Tied Tasks
Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China.;Northeastern Univ, Shenyang, Liaoning, Peoples R China..
Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China..
Northeastern Univ, Shenyang, Liaoning, Peoples R China..
Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China..
Vise andre og tillknytning
2017 (engelsk)Inngår i: 2017 IEEE Real-Time Systems Symposium (RTSS), IEEE, 2017, s. 92-103Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

OpenMP is a promising framework for developing 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 the OpenMP specification. An important feature in OpenMP is tied tasks, which must execute on the same thread during the whole life cycle. Although tied tasks enjoy benefits in simplicity and efficiency, it was considered to be not suitable to real-time systems due to its complex behavior. In this paper, we study the real-time scheduling and analysis of OpenMP task systems with tied tasks. First, we show that under the existing scheduling algorithms in OpenMP, tied tasks indeed may lead to extremely bad timing behaviors where the parallel workload is sequentially executed completely. To solve this problem, we proposed a new scheduling algorithm and developed two response time bounds for it, with different trade-off between simplicity and analysis precision. Experiments with both randomly generated OpenMP task systems and realistic OpenMP programs show that the response time bounds obtained by our approach for tied task systems are very close to that of untied tasks.

sted, utgiver, år, opplag, sider
IEEE, 2017. s. 92-103
Serie
Real-Time Systems Symposium-Proceedings, ISSN 1052-8725
Emneord [en]
real-time-systems, openmp, response-time-analysis, tied-task, parallel-software
HSV kategori
Identifikatorer
URN: urn:nbn:se:uu:diva-351172DOI: 10.1109/RTSS.2017.00016ISI: 000426466700009ISBN: 978-1-5386-1414-3 (digital)OAI: oai:DiVA.org:uu-351172DiVA, id: diva2:1209829
Konferanse
38th IEEE Real-Time Systems Symposium (RTSS), DEC 05-08, 2017, Paris, FRANCE
Tilgjengelig fra: 2018-05-24 Laget: 2018-05-24 Sist oppdatert: 2018-05-24bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Wang, Yi

Søk i DiVA

Av forfatter/redaktør
Wang, Yi
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 37 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf