Communication algorithms in k-ary n-cube interconnection networks

DOI10.1016/S0020-0190(96)00188-3zbMATH Open1337.68026OpenAlexW2004233679MaRDI QIDQ290192FDOQ290192

Authors: Yaagoub Ashir, Iain Stewart, Aqeel Ahmed 

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

Recommendations

• On the k-ary hypercube
• On \(k\)-ary \(n\)-cubes: Theory and applications.
• Routing and wavelength assignment for 3-ary \(n\)-cube communication patterns in linear array optical networks for \(n\) communication rounds
• About message routing in different hypercube interconnection network types.
• Optimal algorithms for total exchange without buffering on the hypercube

zbMATH Keywords

interconnection networksparallel processing\(k\)-ary \(n\)-cubescommunication algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Title not available (Why is that?)
• Lee distance and topological properties of k-ary n-cubes
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• 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

Cited In (15)

• KCube: a novel architecture for interconnection networks
• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• One-to-one communication in twisted cubes under restricted connectivity
• Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
• About message routing in different hypercube interconnection network types.
• Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks
• Augmented \(k\)-ary \(n\)-cubes
• Title not available (Why is that?)
• On \(k\)-ary \(n\)-cubes: Theory and applications.
• The restricted edge-connectivity and restricted connectivity of augmentedk-aryn-cubes
• Total exchange algorithms on 'sandwich graphs'
• Communication Performance Evaluation of the Locally Twisted Cube
• On the communication structures of hyper-ring and hypercube multicomputers
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes

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

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