Showing cs.DCShow all
3 papers · 1 filter
cs.DC2023
Multi-Path Bound for DAG Tasks
Qingqiang He, Nan Guan, Shuai Zhao +1
This paper studies the response time bound of a DAG (directed acyclic graph) task. Recently, the idea of using multiple paths to bound the response time of a DAG task, instead of u…
cs.DC2023
Longer Is Shorter: Making Long Paths to Improve the Worst-Case Response Time of DAG Tasks
Qingqiang He, Nan Guan, Mingsong Lv
DAG (directed acyclic graph) tasks are widely used to model parallel real-time workload. The real-time performance of a DAG task not only depends on its total workload, but also it…
cs.DC2022
Bounding the Response Time of DAG Tasks Using Long Paths
Qingqiang He, Nan Guan, Mingsong Lv +2
In 1969, Graham developed a well-known response time bound for a DAG task using the total workload and the longest path of the DAG, which has been widely applied to solve many sche…