A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes

DOI10.1109/TC.2009.90MaRDI QIDQ5280810zbMATH OpenOpenAlexFDO

Authors Chiara Francalanci, Paolo Giacomazzi

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2009.90

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 2206367
• Deadlock-free routing in k-ary hypercube network in presence of processor failures
• An optimal multicast algorithm for cube-connected cycles
• A MULTICAST ALGORITHM FOR HYPERCUBE MULTIPROCESSORS
• Deadlock-free multicasting in irregular networks using prefix routing
• Multicast algorithms for hypercube multiprocessors

Cited in

(3)

• Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network
• Reliability analysis and fault tolerance for hypercube multi-computer networks
• Deadlock-free routing in k-ary hypercube network in presence of processor failures

This page was built for publication: A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes

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