Distributed algorithms for shortest-path, deadlock-free routing and broadcasting in arbitrarily faulty hypercubes
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Hyperswitch network for the hypercube computerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Routing and broadcasting in faulty hypercube computersPublished by Association for Computing Machinery (ACM) ,1988
- Adaptive packet routing in a hypercubePublished by Association for Computing Machinery (ACM) ,1988
- Hypercube message routing in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1988
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- Reconfiguring a hypercube in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1987
- Advances in Verifiable Fail-Safe Routing ProceduresIEEE Transactions on Communications, 1981
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing TopologyIEEE Transactions on Communications, 1981
- A correctness proof of a topology information maintenance protocol for a distributed computer networkCommunications of the ACM, 1977
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977