Name
Abstract | ||
|---|---|---|
A 2-D torus network is one of a most popular network in the area of parallel processing. Some algorithms have been proposed based on the turn model in past. However, most of those methods cannot be applied to torus network without modifying. In this paper, we propose the North-South First Routing (NSF Routing) which combined the North First method (NF) and the South First method (SF). NF and SF are the part of the algorithms by a Turn model. NSF Routing is applicable to 2-D Torus. Moreover, performance is evaluated by a software simulation. As a result, it was shown that a throughput improves in some communication patterns. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/CANDAR.2013.105 | CANDAR |
Keywords | Field | DocType |
2-d torus network,torus network,adaptive routing,2-d torus,nsf routing,south first method,turn model,north-south first routing,north first method,communication pattern,popular network,parallel processing,network on chip,pattern recognition | Link-state routing protocol,Multipath routing,Hierarchical routing,Grid network,Policy-based routing,Static routing,Computer science,Parallel computing,Routing domain,Routing table | Conference |
Citations | PageRank | References |
2 | 0.39 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasuyuki Miura | 1 | 6 | 5.77 |
| Kentaro Shimozono | 2 | 2 | 0.73 |
| Shigeyoshi Watanabe | 3 | 15 | 7.42 |
| Kazuya Matoyama | 4 | 2 | 0.73 |