异构多核上类型化DAG并行任务的响应时间界
Response Time Bounds for Typed DAG Parallel Tasks on Heterogeneous Multi-cores
摘要:
异构多核利用不同架构的优势来执行特定类型的工作负载,通常提供更高的性能和能效。在本文中,我们研究的最坏情况下的响应时间(WCRT)分析\emph{typed}调度的并行DAG任务异构多核,其中的DAG中的每个顶点的工作负载只允许在一个特定类型的核心上执行。这个问题唯一已知的WCRT界限是非常悲观的,并遭受\emph{non-self-sustainability}问题。在本文中,我们提出了两个新的WCRT界。第一个新的边界具有与现有边界相同的时间复杂度,但更精确,并解决了其\emph{non-self-sustainability}问题。第二个新的界限探索更详细的任务图结构信息,以大大提高精度,但计算成本更高。我们证明了当系统中的类型数是一个变量时,计算第二界的问题是强NP-困难的,并给出了当类型数是一个常数时,具有多项式时间复杂度的有效算法.随机生成的工作负载的实验表明,我们提出的新方法是显着更精确的比现有的界限,同时具有良好的可扩展性。
英文摘要:
Heterogeneous multi-cores utilize the strength of different architectures for executing particular types of workload, and usually offer higher performance and energy efficiency. In this paper, we study the worst-case response time (WCRT) analysis of \emph{typed} scheduling of parallel DAG tasks on heterogeneous multi-cores, where the workload of each vertex in the DAG is only allowed to execute on a particular type of cores. The only known WCRT bound for this problem is grossly pessimistic and suffers the \emph{non-self-sustainability} problem. In this paper, we propose two new WCRT bounds. The first new bound has the same time complexity as the existing bound, but is more precise and solves its \emph{non-self-sustainability} problem. The second new bound explores more detailed task graph structure information to greatly improve the precision, but is computationally more expensive. We prove that the problem of computing the second bound is strongly NP-hard if the number of types in the system is a variable, and develop an efficient algorithm which has polynomial time complexity if the number of types is a constant. Experiments with randomly generated workload show that our proposed new methods are significantly more precise than the existing bound while having good scalability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。