With the advancement in technology, it is now possible to integrate hundreds of cores onto single silicon semiconductor chip or silicon die. In order to provide communication between these cores, large number of resources are required and it leads to the communication problem in System-on- Chip (SoC), which is solved by introduction of Networks-on-Chip (NoC). NoC proves to be most efficient in terms of flexibility, scalability and parallelism. In this paper, the proposed mapping algorithms, Horological Mapping (HorMAP), Rotational Mapping (RtMAP) and Divide and Conquer Mapping (DACMAP) for mapping of tasks onto cores, basically concentrate on the optimization of latency, queuing time, service time and energy consumption of topology at constant bandwidth required. The experimental results discussed in this paper shows the comparison of proposed algorithms with traditional random mapping algorithm. In this paper, 2D mesh topology with XY routing is considered for the simulation of proposed algorithms.

随着技术的进步，现在可以将数百个内核集成到单个硅半导体芯片或硅芯片上。为了提供这些内核之间的通信，需要大量资源，这导致了片上系统（SoC）中的通信问题，通过引入片上网络（NoC）解决了该问题。NoC 在灵活性、可扩展性和并行性方面被证明是最有效的。本文提出的映射算法，Horological Mapping (HorMAP)、Rotational Mapping (RtMAP) 和 Divide and Conquer Mapping (DACMAP) 用于将任务映射到内核上，基本上集中在延迟、排队时间、服务时间和能量的优化上。所需的恒定带宽下的拓扑消耗。本文讨论的实验结果显示了所提出算法与传统随机映射算法的比较。在本文中，考虑了 XY 路由的 2D 网格拓扑来模拟所提出的算法。