Name
Abstract | ||
|---|---|---|
How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm. It cannot account for why routing algorithm with high degree of adaptiveness may have poor performance. Simulation has to be carried out to evaluate performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring performance of routing algorithm. It has higher precision of measuring routing algorithm performance than the degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TPDS.2013.184 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
channel pressure,network routing,noc,routing algorithm,routing pressure,metric of routing,channel-related metric,routing pressure metric,traffic-aware metric,network-on-chip,algorithm design and analysis,computational modeling,topology,network on chip,pressure measurement,routing | Equal-cost multi-path routing,Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
26 | 3 | 1045-9219 |
Citations | PageRank | References |
6 | 0.43 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minghua Tang | 1 | 37 | 7.73 |
| Xiaola Lin | 2 | 1099 | 78.09 |
| Maurizio Palesi | 3 | 1119 | 78.82 |