Fault-tolerant permutation routing in hypercubes

DOI10.1006/JPDC.1993.1027zbMATH Open0788.68008OpenAlexW2009381693MaRDI QIDQ2365573FDOQ2365573

Authors: Mee Yee Chan, Shiang-Jen Lee 

Publication date: 29 June 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1993.1027

Recommendations

• Fault-tolerant wormhole routing for hypercube networks
• Fault-tolerant routing in hypercubes using probability vectors
• On fault-tolerant fixed routing in hypercubes
• A fault-tolerant routing strategy in hypercube multicomputers
• scientific article; zbMATH DE number 139788

zbMATH Keywords

online routingbinary hypercubeBatcher's bitonic sortingfault-tolerant permutation routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cited In (6)

• The Josephus Cube: analysis of routing and fault tolerance
• Probability-based fault-tolerant routing in hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fault-tolerant routing in hypercubes using probability vectors
• A \(d\)-move local permutation routing for the \(d\)-cube

This page was built for publication: Fault-tolerant permutation routing in hypercubes

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