Dense Gaussian networks: Suitable topologies for on-chip multiprocessors

Simple item page
dc.contributor.authorMartinez, C.
dc.contributor.authorVallejo, E.
dc.contributor.authorBeivide, R.
dc.contributor.authorIzu, M.
dc.contributor.authorMoreto, M.
dc.date.issued2006
dc.description.abstractThis 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.
dc.description.statementofresponsibilityCarmen Martínez, Enrique Vallejo, Ramón Beivide, Cruz Izu and Miquel Moretó
dc.identifier.citationInternational Journal of Parallel Programming, 2006; 34(3):193-211
dc.identifier.doi10.1007/s10766-006-0014-1
dc.identifier.issn0885-7458
dc.identifier.issn1573-7640
dc.identifier.orcidIzu, M. [0000-0002-7492-8886]
dc.identifier.urihttp://hdl.handle.net/2440/22988
dc.language.isoen
dc.publisherKluwer Academic/plenum Publ
dc.source.urihttp://www.springerlink.com/content/a0mqh75883168164/
dc.subjecton-chip networks
dc.subjecttopology
dc.subjectlay-out
dc.subjectrouting
dc.subjectbroadcasting
dc.subjectcirculant graphs.
dc.titleDense Gaussian networks: Suitable topologies for on-chip multiprocessors
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Computer Science publications