An Effective Technique to Reduce Querying Routing Table for Mesh-based Network-on-Chip

Abstract

The table-based routing algorithm of NoC takes advantage of the application specific communication information to improve the adaptivity and guarantee the deadlock freedom at the same time. However, the router queries the routing table whenever a packet is to be forwarded. It costs time although some methods have been proposed to shorten the table size. Averagely, two neighbor routers have the same routing options for over 50% packets. In this paper, we propose a technique to make those packets pass through the router without querying the routing table. Consequently, the times to query the routing table is decreased greatly. Simulation results show that this leads up to 16% decrease of average packet delay.