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

DOI10.1515/AMCS-2015-0052zbMath1347.68014OpenAlexW2400761645MaRDI QIDQ326993

Keiichi Kaneko, Antoine Bossard

Publication date: 13 October 2016

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

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

zbMATH Keywords

interconnection networksrouting algorithmssupercomputersparallel systemsHamiltonian cycle problemHamiltonian path problem

Mathematics Subject Classification ID

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

Cites Work

• Efficient collective communications in dual-cube
• CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES
• Conditional fault diagnosis of hierarchical hypercubes

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