Loading [a11y]/accessibility-menu.js
Partitioning-Based Scheduling of OpenMP Task Systems With Tied Tasks | IEEE Journals & Magazine | IEEE Xplore

Partitioning-Based Scheduling of OpenMP Task Systems With Tied Tasks


Abstract:

OpenMP is a popular programming framework in both general and high-performance computing and has recently drawn much interest in embedded and real-time computing. Althoug...Show More

Abstract:

OpenMP is a popular programming framework in both general and high-performance computing and has recently drawn much interest in embedded and real-time computing. Although the execution semantics of OpenMP are similar to the DAG task model, the constraints posed by the OpenMP specification make them significantly more challenging to analyze. A tied task is an important feature in OpenMP that must execute on the same thread throughout its entire life cycle. A previous work [1] succeeded in analyzing the real-time scheduling of tied tasks by modifying the Task Scheduling Constraints (TSCs) in OpenMP specification. In this article, we also study the real-time scheduling of OpenMP task systems with tied tasks but without changing the original TSCs. In particular, we propose a partitioning-based algorithm, P-EDF-omp, by which the tied constraint can be automatically guaranteed as long as an OpenMP task system can be successfully partitioned to a multiprocessor platform. Furthermore, we conduct comprehensive experiments with both synthetic workloads and established OpenMP benchmarks to show that our approach consistently outperforms the work in [1] —even without modifying the TSCs.
Published in: IEEE Transactions on Parallel and Distributed Systems ( Volume: 32, Issue: 6, 01 June 2021)
Page(s): 1322 - 1339
Date of Publication: 31 December 2020

ISSN Information:

Funding Agency:


References

References is not available for this document.