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.

中文翻译：

---

具有分区任务的OpenMP任务系统基于分区的调度

OpenMP是通用和高性能计算中流行的编程框架，并且最近引起了嵌入式和实时计算的极大兴趣。尽管OpenMP的执行语义与DAG任务模型相似，但是OpenMP规范所构成的约束使它们在分析方面更具挑战性。一个绑任务是OpenMP的一项重要功能，必须在其整个生命周期中都在同一线程上执行。以前的工作[1] 成功地分析了 绑通过修改OpenMP规范中的任务调度约束（TSC）来完成任务。在本文中，我们还研究了具有以下功能的OpenMP任务系统的实时调度：绑任务，但不更改原始TSC。特别是，我们提出了一种基于分区的算法P-EDF-omp，通过该算法，绑只要可以将OpenMP任务系统成功分区到多处理器平台，就可以自动保证约束。此外，我们对综合工作负载和已建立的OpenMP基准进行了全面的实验，以表明我们的方法在性能上始终胜过[1] -即使不修改TSC。