An enhanced cost-aware mapping algorithm based on improved shuffled frog leaping in network on chips

Network on chip (NoC) has been of great interest in recent years. However, according to the recent studies, high communication cost has been raised as the one most important challenges in mapping process in NoC. In order to address these issues, this research takes the advantages of the improved shuffled frog leaping based on two-dimensional torus networks in figure of an enhanced algorithm. In other words, using the proposed mapping category features, increase in the number of nodes has very little effect on the provided performance by the proposed algorithm, because it first improves the write cost of each cluster with less instead of high communication cost. Moreover, nodes having greater relevance in the graph of application are often adjacent to each other. Therefore, while the communication cost is reduced, the search space mapping gets larger which leads to easier and less costly access to the optimal mapping. In fact, between two nodes with higher weight, it is less distance to write in the network substrate. This reduction reduces the distance between the two nodes in the end, reducing the cost of communication. Simulation results show that the communication cost is improved by 3.62, 0.90, 0.72 and 1.35% compared to PSMAP algorithm for the 263dec mp3dec graph, Lmap algorithm for the 263enc mp3dec graph, Lmap algorithm for the MWD graph and PSMAP algorithm for MPEG-4 graph, respectively.