Name
Abstract | ||
|---|---|---|
This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor √2, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node's labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10766-006-0014-1 | International Journal of Parallel Programming |
Keywords | Field | DocType |
implementation issue,lay-out,dense gaussian network,on-chip networks,routing,torus diameter,network folding,circulant graphs.,hierarchical network,suitable topology,optimal solution,on-chip multiprocessors,broadcasting,important architectural issue,new two-dimensional node,collective communication,topology,dense circulant graph,on-chip interconnection network,col,network topology,chip,circulant graph | Computer science,Computer network,Theoretical computer science,Circulant matrix,Distributed computing,Broadcasting,Parallel computing,Torus,Network topology,Gaussian,Unicast,Interconnection,Scalability | Journal |
Volume | Issue | ISSN |
34 | 3 | 1573-7640 |
Citations | PageRank | References |
16 | 0.86 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carmen Martínez | 1 | 16 | 0.86 |
| Enrique Vallejo | 2 | 164 | 19.96 |
| Ramón Beivide | 3 | 259 | 30.33 |
| Cruz Izu | 4 | 149 | 23.41 |
| Miquel Moretó | 5 | 205 | 25.49 |