Evaluation of static and dynamic task mapping algorithms in NoC-based MPSoCs
Evaluation of static and dynamic task mapping algorithms in NoC-based MPSoCs
复制标题
基于 NoC 的 MPSoC 中静态和动态任务映射算法的评估
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
F. Moraes
中科院分区：
文献类型：
--
作者：
Ewerson Carvalho;C. Marcon;Ney Laert Vilar Calazans;F. Moraes
任务映射是MPSOC设计中的重要问题。最新的映射算法在设计时执行它们，这种方法称为静态映射。尽管如此，在MPSOC中运行的应用程序可能会执行不同数量的同时任务。在某些情况下，只有在系统设计后才能定义应用程序，从而强制执行需要使用动态任务映射的方案。静态映射具有系统的主要优势，而动态映射通常提供本地视图，该视图仅考虑映射任务的邻域。这项工作旨在评估静态和动态映射解决方案的利弊。由于全球系统的观点，预计静态映射算法可以实现出色的性能（W.R.T.延迟，拥塞，能源消耗）。由于动态场景是当前MPSOC设计的趋势，因此必须知道动态映射算法的成本，并且在不增加执行时间的情况下，应提供提高此类算法质量的方向。静态和动态映射算法之间的定量比较是这项工作的主要贡献。
Task mapping is an important issue in MPSoC design. Most recent mapping algorithms perform them at design time, an approach known as static mapping. Nonetheless, applications running in MPSoCs may execute a varying number of simultaneous tasks. In some cases, applications may be defined only after system design, enforcing a scenario that requires the use of dynamic task mapping. Static mappings have as main advantage the global view of the system, while dynamic mappings normally provide a local view, which considers only the neighborhood of the mapping task. This work aims to evaluate the pros and cons of static and dynamic mapping solutions. Due to the global system view, it is expected that static mapping algorithms achieve superior performance (w.r.t. latency, congestion, energy consumption). As dynamic scenarios are a trend in present MPSoC designs, the cost of dynamic mapping algorithms must be known, and directions to improve the quality of such algorithms should be provided without increasing execution time. This quantitative comparison between static and dynamic mapping algorithms is the main contribution of this work.