1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Response Time Bounds for Typed DAG Parallel Tasks on Heterogeneous Multi-cores
Meiling Han, Nan Guan, Jinghao Sun +3
Heterogeneous multi-cores utilize the strength of different architectures for executing particular types of workload, and usually offer higher performance and energy efficiency. In…
Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks
Gang Chen, Nan Guan, Di Liu +4
Mixed-criticality models are an emerging paradigm for the design of real-time systems because of their significantly improved resource efficiency. However, formal mixed-criticality…