3D MAX : a maximally adaptive routing method for VC-less 3D mesh-based Networks-on-Chip

The most valuable attribute of 3D Networks-on-Chip (NoCs) is the very small distance between the layers. Yet, this potential will go unrealized without the design of efficient routing methods. In this paper, we introduce 3D MAX, a maximally adaptive routing strategy for fully-connected 3D mesh networks. The proposed routing technique which is developed upon the EbDa theory exploits three key features to realize effective communication across the chip. First, from the turn model’s perspective, the minimum number of turns is prohibited such that the degree of routing adaptiveness is maximized. Second, 3D MAX is designed from an odd-even perspective in order to maintain a balanced traffic distribution. Third, the deadlock-freedom is guaranteed while eliminating the need for VCs or routing tables.The most valuable attribute of 3D Networks-on-Chip (NoCs) is the very small distance between the layers. Yet, this potential will go unrealized without the design of efficient routing methods. In this paper, we introduce 3D MAX, a maximally adaptive routing strategy for fully-connected 3D mesh networks. The proposed routing technique which is developed upon the EbDa theory exploits three key features to realize effective communication across the chip. First, from the turn model’s perspective, the minimum number of turns is prohibited such that the degree of routing adaptiveness is maximized. Second, 3D MAX is designed from an odd-even perspective in order to maintain a balanced traffic distribution. Third, the deadlock-freedom is guaranteed while eliminating the need for VCs or routing tables.P