Traffic-Balanced Routing Algorithm for Irregular Mesh-Based On-Chip Networks

• Main Authors: Chun-Hsiang Huang, 黃群翔
• Other Authors: 吳安宇
• Format: Others
• Language: en_US
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/62823154909881740297

碩士 === 臺灣大學 === 電子工程學研究所 === 95 === On-chip networks (OCNs) have been proposed to solve increasing scale and complexity of the designs in nano-scale VLSI designs. In OCNs, the concept of irregular mesh is an important issue because IPs with different sizes can be supported. In order to solve routing on irregular mesh, modified routing algorithms to detour oversized IPs (OIPs) are needed. Fault-tolerant routing algorithms have been thought as solutions for irregular mesh because of the similar topology, faulty mesh, in multicomputer system. However, directly applying fault-tolerant routing algorithms may cause two serious problems: 1) heavy traffic loads around OIPs and unbalanced traffic loads on irregular meshes, 2) some paths of packets much longer than minimal path. In this thesis, we propose an OIP avoidance pre-routing (OAPR) algorithm to solve the aforementioned problems. OAPR can make traffic loads even spread on the networks, and shorten some paths of packets. Therefore, the networks using OAPR have lower latency and higher throughput than those using fault-tolerant routing algorithms. In our experiments, three different cases are simulated to demonstrate that proposed OAPR improve 55.6% ~ 100% sustainable throughputs than two cited fault-tolerant routing algorithm, Chen and Chiu’s algorithm [15] and extended XY routing algorithm [17]. Finally, we implement OAPR into hardware. The area overhead of OAPR is less than 1% compared to a whole router [24]. OAPR algorithm has good performance and is practical for irregular mesh-based OCNs.