Fault-aware task re-mapping for throughput constrained multimedia applications on NoC-based MPSoCs
Fault-aware task re-mapping for throughput constrained multimedia applications on NoC-based MPSoCs
复制标题
基于 NoC 的 MPSoC 上吞吐量受限的多媒体应用的故障感知任务重新映射
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Akash Kumar
中科院分区：
文献类型：
--
作者：
Anup Das;Akash Kumar
缩小的晶体管几何形状和攻击性电压缩放导致人们对多处理器系统的可靠性越来越关注。大多数流媒体多媒体应用的特征是固定的吞吐量要求；违反直接影响用户体验的行为。先前的研究都没有考虑吞吐量和任务迁移开销的联合处理，这两者对于易于断层受限的多媒体多处理器系统至关重要。在本文中，我们建议将任务从故障处理器中重新启动，目的是最大程度地降低迁移开销的目的，同时满足吞吐量约束。提出的技术基于对不同故障场景的广泛设计时间分析，以确定从吞吐量移民开销空间中的最佳映射。这些映射存储在表中，并在运行时查找以在发生故障时迁移任务。应用程序是使用同步数据流程图（SDFG）建模的，以考虑任务的循环依赖性，通常在多媒体系统中找到。使用合成和真实应用图进行的实验表明，在仍达到吞吐量约束的同时，可以平均将迁移开销降低26％。此外，通过选择适当的初始处理器任务映射，可以平均将迁移开销进一步降低15％。
Shrinking transistor geometry and aggressive voltage scaling are leading to growing concerns on the reliability of multiprocessor systems. Majority of streaming multimedia applications are characterized by fixed throughput requirements; violation of which directly impacts user experience. None of the prior research considers joint treatment of throughput and task-migration overhead, both of which are essential for fault-tolerance of throughput-constrained multimedia multiprocessor systems. In this paper, we propose to remap tasks from faulty processors with the objective of minimizing the migration overhead while satisfying throughput constraints. The proposed technique is based on extensive design-time analysis of different fault scenarios to determine optimal mappings from the throughput-migration overhead Pareto space. These mappings are stored in a table and are looked-up at run-time to migrate tasks as and when faults occur. Applications are modeled using Synchronous Data Flow graphs (SDFG) to consider cyclic dependencies of tasks, typically found in multimedia systems. Experiments performed with synthetic and real application graphs demonstrate that the migration overhead can be reduced by 26% on average while still meeting throughput constraints. Moreover, by selecting an appropriate initial processor-task mapping, migration overhead can be further reduced by 15% on average.