Martinez, C.Vallejo, E.Beivide, R.Izu, M.Moreto, M.2007-01-152007-01-152006International Journal of Parallel Programming, 2006; 34(3):193-2110885-74581573-7640http://hdl.handle.net/2440/22988This 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.enon-chip networkstopologylay-outroutingbroadcastingcirculant graphs.Journal article002006097010.1007/s10766-006-0014-10002393554000022-s2.0-3374660071852589Izu, M. [0000-0002-7492-8886]