Torus-connected cycles: a simple and scalable topology for interconnection networks

DOI10.1515/AMCS-2015-0052MaRDI QIDQ326993zbMATH OpenOpenAlexFDO

Authors Antoine Bossard, Keiichi Kaneko

Publication date 13 October 2016

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/amcs-2015-0052

zbMATH Keywords

interconnection networksparallel systemsHamiltonian cycle problemHamiltonian path problemrouting algorithmssupercomputers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Recommendations

• Supercube: An optimally fault tolerant network architecture
• The extended cube connected cycles: an efficient interconnection for massively parallel systems
• A class of hierarchical graphs as topologies for interconnection networks
• X-Torus: A Variation of Torus Topology with Lower Diameter and Larger Bisection Width
• The Josephus cube: A novel interconnection network

Cites work

• Conditional fault diagnosability of dual-cubes
• Conditional fault diagnosis of hierarchical hypercubes
• Efficient collective communications in dual-cube

Cited in

(1)

• Basic routines for the Rank-2k update: 2D torus vs reconfigurable network

This page was built for publication: Torus-connected cycles: a simple and scalable topology for interconnection networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326993)