Journal
IEEE TRANSACTIONS ON COMPUTERS
Volume 71, Issue 7, Pages 1495-1506Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TC.2021.3092181
Keywords
Real-time systems; partitioned scheduling; directed acyclic graph; response time analysis
Funding
- National Key Research and Development Program of China [2020YFB1406902]
- Key-Area Research and Development Program of Guangdong Province [2020B0101360001]
- Shenzhen Science and Technology Research and Development Fundation [JCYJ20190806143418198]
- National Natural Science Foundation of China (NSFC) [61872110]
Ask authors/readers for more resources
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.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available