Deadlock-free routing in k-ary hypercube network in presence of processor failures
From MaRDI portal
Publication:910198
DOI10.1016/0020-0190(90)90017-RzbMATH Open0695.68023OpenAlexW1971423961MaRDI QIDQ910198FDOQ910198
Authors: N. E. Zubov 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90017-r
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
Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99) Theory of operating systems (68N25)
Cites Work
Cited In (6)
- Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
- A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
- Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks
- Minimum deadlock-free message routing restrictions in binary hypercubes
- An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
- Title not available (Why is that?)
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)
