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

DOI10.1109/TC.2009.90zbMath1368.68128OpenAlexW2112165064MaRDI QIDQ5280810

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)

Related Items (2)

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

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