Partitioning-Based Scheduling of OpenMP Task Systems With Tied Tasks

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 <monospace>tied</monospace> task is an important feature in OpenMP that must execute on the same thread throughout its entire life cycle. A previous work <xref ref-type="bibr" rid="ref1">[1]</xref> succeeded in analyzing the real-time scheduling of <monospace>tied</monospace> 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 <monospace>tied</monospace> tasks but without changing the original TSCs. In particular, we propose a partitioning-based algorithm, P-EDF-omp, by which the <monospace>tied</monospace> 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 <xref ref-type="bibr" rid="ref1">[1]</xref> —even without modifying the TSCs.