A Fault-Tolerant Communication Architecture for Distributed Systems
From MaRDI portal
Cited in
(15)- Fault tolerance of Möbius cubes under two forbidden fault set models
- Distributed loop network with minimum transmission delay
- DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS
- A new 3D representation of trivalent Cayley networks
- Communication aspects of networks based on geometric incidence relations
- Upper bounds on the connection probability for 2-D meshes and tori
- Shortest routing in trivalent Cayley graph network
- Trivalent Cayley graphs for interconnection networks
- scientific article; zbMATH DE number 1471732 (Why is no real title available?)
- SOFTWARE TOOLS FOR MULTIPROCESSOR SIMULATION AND PROGRAMMING
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
- Graph theoretic characterization and reliability of the multiple-clique network
- Large fault-tolerant interconnection networks
- An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
- A new approach for routing in arrangement graphs and its performance evaluation
This page was built for publication: A Fault-Tolerant Communication Architecture for Distributed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3950485)