Improving Interference Analysis for Real-Time DAG Tasks Under Partitioned Scheduling

Real-time systems with strict timing constraints have been widely applied in many fields. The Directed acyclic graph (DAG) task model has been widely studied and applied to model real-time systems with partial parallelism and precedence constraints in each task. Our paper focuses on the worst-case response time (WCRT) analysis of DAG tasks under partitioned scheduling on multiprocessors. We investigate a parallel structure named Str, which helps obtain more accurate analysis results, and propose a new offline scheduling analysis algorithm named reducing repetitive calculation (RRC). Experiments with synthetic workload are conducted to compare the results calculated by RRC and the state-of-the-art, as well as the observed average response time on a real embedded system. Results show that RRC has better performance in terms of analysis accuracy.

Automated summary

This paper focuses on the worst-case response time analysis of DAG tasks under partitioned scheduling on multiprocessors. A new offline scheduling analysis algorithm called reducing repetitive calculation (RRC) is proposed. Experimental results show that RRC outperforms the state-of-the-art methods in terms of analysis accuracy.