Name
Abstract | ||
|---|---|---|
Diameter and average distance are two important metrics in topology selection for on-chip networks. In order to lower down them in Mesh, DMesh is proposed by introducing diagonal links. Compared to Mesh, the port number in routers of DMesh almost doubles, thus high-radix routers are required. The ever increasing pin bandwidth enables design of high-radix routers to improve performance of the overall network. However, the original algorithm DXY always prefers to use the crossing links, and does not make efficient use of physical channels. Though quasi-minimal routing algorithm provides some adaptivity, it limits packets routing in the rectangular defined by source and destination nodes. In this paper, we present a novel deadlock-free and livelock-free routing algorithm for DMesh, and it provides much more flexibility for packets in order to make better use of different links. Simulation results validate the effectiveness of the novel routing scheme as compared to the existed algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1587/elex.12.20150353 | IEICE ELECTRONICS EXPRESS |
Keywords | Field | DocType |
on-chip network, DMesh, routing algorithm, deadlock-free, livelock-free | Deadlock free,Computer science,Computer network,Routing algorithm,Distributed computing | Journal |
Volume | Issue | ISSN |
12 | 12 | 1349-2543 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinyu Wang | 1 | 117 | 28.52 |
| Zhigang Yu | 2 | 7 | 1.80 |
| Kele Shen | 3 | 29 | 5.51 |
| Moyuan Wang | 4 | 0 | 0.34 |