Efficient collective communications in dual-cube

DOI10.1023/B:SUPE.0000014803.83151.DCzbMath1101.68340MaRDI QIDQ704726

Shietung Peng, Wanming Chu, Ya-Min Li

Publication date: 19 January 2005

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

algorithmhypercubeInterconnection networkbroadcast and personalized communicationscollective communications

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET ⋮ Torus-connected cycles: a simple and scalable topology for interconnection networks ⋮ Conditional edge-fault-tolerant Hamiltonicity of dual-cubes ⋮ The domination number of exchanged hypercubes ⋮ Routing and wavelength assignment for exchanged hypercubes in linear array optical networks ⋮ A comment on ``The domination number of exchanged hypercubes ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ A THREE-ROUND ADAPTIVE DIAGNOSTIC ALGORITHM IN A DISTRIBUTED SYSTEM MODELED BY DUAL-CUBES ⋮ CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES

This page was built for publication: Efficient collective communications in dual-cube