Deadlock-free routing in k-ary hypercube network in presence of processor failures
From MaRDI portal
(Redirected from Publication:910198)
Recommendations
- Adaptive fault-tolerant deadlock-free routing in meshes and hypercubes
- scientific article; zbMATH DE number 2206367
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
- scientific article; zbMATH DE number 6863762
- A generic design methodology for deadlock-free routing in multicomputer networks
- On fault-tolerant fixed routing in hypercubes
- Deadlock-free message routing in multicomputer networks
Cites work
Cited in
(6)- An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
- Minimum deadlock-free message routing restrictions in binary hypercubes
- Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks
- scientific article; zbMATH DE number 749818 (Why is no real title available?)
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
This page was built for publication: Deadlock-free routing in k-ary hypercube network in presence of processor failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910198)