Affiliation:
1. Northeastern University, China
2. Chinese Academy of Sciences, China
3. Uppsala University, Sweden
Abstract
In the formal analysis of real-time systems, modeling of branching codes and modeling of intratask parallelism structures are two of the most important research topics. These two real-time properties are combined, resulting in the fork-join real-time task (FJRT) model, which extends the digraph-based task model with forking and joining semantics. We prove that the EDF schedulability problem on a preemptive uniprocessor for the FJRT model is coNP-hard in the strong sense, even if the utilization of the task system is bounded by a constant strictly less than 1. Then, we show that the problem becomes tractable with some slight structural restrictions on parallel sections, for which we propose an exact schedulability test with pseudo-polynomial time complexity. Our results thus establish a borderline between the tractable and intractable FJRT models.
Funder
Natural Science Foundation of China
National Basic Pre-research Program of China
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Real-Time Task Models;Handbook of Real-Time Computing;2022
2. Simultaneous Scheduling and Core-Type Optimization for Moldable Fork-Join Tasks on Heterogeneous Multicores;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021
3. Algorithms for Computing the WCRT Bound of OpenMP Task Systems With Conditional Branches;IEEE Transactions on Computers;2021-01-01
4. Efficient Feasibility Analysis for Graph-Based Real-Time Task Systems;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2020-11
5. Scheduling of moldable fork-join tasks with inter- and intra-task communications;Proceedings of the 23th International Workshop on Software and Compilers for Embedded Systems;2020-05-25