Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks

DOI10.1016/S0020-0190(96)00188-3zbMath1337.68026OpenAlexW2004233679MaRDI QIDQ290192

F. Blanchet-Sadri, M. Dambrine

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00188-3

zbMATH Keywords

interconnection networksparallel processingcommunication algorithms\(k\)-ary \(n\)-cubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (7)

Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes ⋮ Augmented \(k\)-ary \(n\)-cubes ⋮ On \(k\)-ary \(n\)-cubes: Theory and applications. ⋮ Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults ⋮ The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes ⋮ Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes ⋮ Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks

Cites Work

• Unnamed Item
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Lee distance and topological properties of k-ary n-cubes
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks