Utilization bound is a well-known concept in real-time scheduling theory for sequential periodic tasks, which can be used both for quantifying the performance of scheduling algorithms and as efficient schedulability tests. However, the schedulability of parallel real time task graphs depends on not only utilization, but also another parameter tensity, the ratio between the longest path length and period. In this paper, we use utilization-tensity bounds to better characterize the schedulability of parallel real-time tasks. In particular, we derive utilization-tensity bounds for parallel DAG tasks under global EDF scheduling, which facilitate significantly more precise schedulability analysis than the state-of-the-art analysis techniques based on capacity augmentation bound and response time analysis. Moreover, we apply the above results to the federated scheduling paradigm to improve the system schedulability by choosing proper scheduling strategies for tasks with different workload and structure features.

中文翻译：

---

全局 EDF 调度下实时 DAG 任务的利用强度界限

利用率界限是顺序周期任务实时调度理论中的一个众所周知的概念，它既可用于量化调度算法的性能，也可用作有效的可调度性测试。然而，并行实时任务图的可调度性不仅取决于利用率，还取决于另一个参数强度，即最长路径长度和周期之间的比率。在本文中，我们使用利用率-强度边界来更好地表征并行实时任务的可调度性。特别是，我们推导出了全局 EDF 调度下并行 DAG 任务的利用率-强度边界，这比基于容量增加边界和响应时间分析的最先进的分析技术显着促进了更精确的可调度性分析。而且，