Efficient Parallel Routing Algorithms for Cartesian and Composition Networks

DOI10.1007/978-3-540-89985-3_37MaRDI QIDQ3628471zbMATH OpenOpenAlexFDO

Authors Marzieh Bakhshi, Saeedeh Bakhshi, Hamid Sarbazi-Azad

Publication date 20 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89985-3_37

zbMATH Keywords

Cartesian productcomposition productconnectivityfault tolerant routingparallel routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Parallel Algorithms for Network Routing Problems and Recurrences
• Parallel algorithms for routing in nonblocking networks
• A fast parallel algorithm for routing in permutation networks
• Parallel routing algorithms for incomplete hypercube interconnection networks
• A parallel optimal routing algorithm
• Individually optimal routing in parallel systems
• Computational Science – ICCS 2005
• scientific article; zbMATH DE number 1163097
• scientific article; zbMATH DE number 3870534
• Optimal routing algorithms for mesh-connected processor arrays

Cites work

• Generalized diameters and Rabin numbers of networks
• Graph theory with applications
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• The wide-diameter of then-dimensional toroidal mesh

Cited in

(1)

• A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square

This page was built for publication: Efficient Parallel Routing Algorithms for Cartesian and Composition Networks

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