Adaptive fault-tolerant routing in hypercube multicomputers
From MaRDI portal
Publication:5375454
DOI10.1109/12.61061zbMath1395.68050OpenAlexW2162229987MaRDI QIDQ5375454
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c8d2a841c4460b1f3e2e55f6d22453fe18c6bf7c
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (4)
A depth-first search routing algorithm for star graphs and its performance evaluation ⋮ A new approach for routing in arrangement graphs and its performance evaluation ⋮ Distributed computing on oriented anonymous hypercubes with faulty components ⋮ An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
This page was built for publication: Adaptive fault-tolerant routing in hypercube multicomputers
