A hybrid strategy for mapping multiple throughput-constrained applications on MPSoCs
A hybrid strategy for mapping multiple throughput-constrained applications on MPSoCs
复制标题
DOI：
10.1145/2038698.2038726
复制
发表时间：
2011-10
期刊：
影响因子：
--
通讯作者：
Ashutosh Kumar Singh;Akash Kumar;T. Srikanthan
中科院分区：
文献类型：
--
作者：
Ashutosh Kumar Singh;Akash Kumar;T. Srikanthan
现代嵌入式系统基于多处理器片上系统 (MPSoC)，以满足多个应用的严格时序期限。必须通过以吞吐量感知方式映射应用程序来有效利用 MPSoC 资源，以满足每个应用程序的吞吐量限制。设计时方法仅适用于具有静态行为的预定义应用程序集，无法处理应用程序中的动态性。另一方面，运行时方法可以满足动态性，但由于运行时计算量大，无法为所有应用程序提供时序保证。本文提出了一种混合流程，该流程在设计时执行计算密集型分析，以得出多个资源吞吐量权衡点，并在运行时根据可用资源和所需吞吐量选择其中一个。实验结果表明，与最先进的技术相比，设计时分析速度提高了 39%，提供了更好的权衡点，运行时映射速度提高了 93%。
Modern embedded systems are based on Multiprocessor-Systems-on-Chip (MPSoCs) to meet the strict timing deadlines of multiple applications. MPSoC resources must be utilized efficiently by mapping the applications in throughput-aware manner in order to meet throughput constraints for each of them. A design-time methodology is applicable only to predefined set of applications with static behavior, which is incapable of handling dynamism in applications. On the other hand, a run-time approach can cater to the dynamism but cannot provide timing guarantees for all the applications due to large computation requirements at run-time. This paper presents a hybrid flow which performs compute intensive analysis at design-time to derive multiple resource-throughput trade-off points and selects one of these at runtime subject to available resources and desired throughput. Experimental results show that the design-time analysis is faster by 39%, provides better trade-off points and the runtime mapping is speeded up by 93% when compared to state-of-the-art techniques.