uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • 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..
Show others and affiliations
2017 (English)In: 2017 IEEE Real-Time Systems Symposium (RTSS), IEEE, 2017, p. 92-103Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
IEEE, 2017. p. 92-103
Series
Real-Time Systems Symposium-Proceedings, ISSN 1052-8725
Keywords [en]
real-time-systems, openmp, response-time-analysis, tied-task, parallel-software
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-351172DOI: 10.1109/RTSS.2017.00016ISI: 000426466700009ISBN: 978-1-5386-1414-3 (electronic)OAI: oai:DiVA.org:uu-351172DiVA, id: diva2:1209829
Conference
38th IEEE Real-Time Systems Symposium (RTSS), DEC 05-08, 2017, Paris, FRANCE
Available from: 2018-05-24 Created: 2018-05-24 Last updated: 2018-05-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Wang, Yi

Search in DiVA

By author/editor
Wang, Yi
By organisation
Computer Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf