Quasi-static scheduling of data flow graphs in the presence of limited channel capacities
Quasi-static scheduling of data flow graphs in the presence of limited channel capacities
复制标题
DOI：
10.1109/estimedia.2015.7351766
复制
发表时间：
2015-12
期刊：
影响因子：
--
通讯作者：
J. Falk;Tobias Schwarzer;M. Glaß;J. Teich;Christian Zebelein;C. Haubelt
中科院分区：
文献类型：
--
作者：
J. Falk;Tobias Schwarzer;M. Glaß;J. Teich;Christian Zebelein;C. Haubelt
多媒体应用中的信号处理算法通常由动态数据流图（DFG）建模，特别是在针对异构多核平台时。然而，在应用程序的细粒度和平台的粗粒度之间经常存在不匹配。通过采用准静态调度（Quasi-Static Schedules，QSS）来针对给定平台定制DFG的粒度，通过减少动态调度开销并实现针对参与者组而不是孤立的单个参与者的优化来保证性能增益。不幸的是，从文献中已知的计算QSS的所有方法都隐含地假设DFG具有无界的先进先出（FIFO）通道。相比之下，DFG到多核平台的映射必须坚持具有有限容量的FIFO通道。在本文中，我们提出了一种新的FIFO通道容量调整算法，使QSS的DFG有限的通道容量，从而扩展范围的QSS细化到一般的多核目标。
Signal processing algorithms as can be found in multimedia applications are often modeled by dynamic Data Flow Graphs (DFGs), especially when targeting heterogeneous multicore platforms. However, there is often a mismatch between the fine granularity of the application and the coarse granularity of the platform. Tailoring the granularity of the DFG to a given platform by employing Quasi-Static Schedules (QSSs) promises performance gains by reducing dynamic scheduling overhead and enabling optimizations targeting groups of actors instead of individual actors in isolation. Unfortunately, all approaches known from literature to compute QSSs implicitly assume DFGs with unbounded First In First Out (FIFO) channels. In contrast, mappings of DFGs to multi-core platforms must adhere to FIFO channels with limited capacities. In this paper, we present a novel FIFO channel capacity adjustment algorithm that enables QSSs to DFGs with limited channel capacities, thus, extending the scope of QSS refinements to general multi-core targets.