A new application mapping strategy for Mesh-of-Tree based Network-on-Chip

Abstract

This paper addresses the problem of application mapping for Mesh-of-Tree (MoT) based Network-on-Chip. It proposes a new algorithm based on Kernighan-Lin partitioning to identify closely related cores of the application. The nodes are then mapped to the topology using another heuristic algorithm. The MoT mapping results have been compared with the mesh-mapping results reported in the literature for some benchmark applications. Both static communication cost and dynamic costs (including latency and throughput) of the mapped solution have been compared.