IEEE Transactions on Computers · 1987 · 65 citations · 11 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingInterconnection NetworksGraph AlgorithmsGraph TheoryNetwork Fault ToleranceNetwork StructureNetwork TheoryNetwork TopologyDiameter In Interconnection NetworksFault DiameterFault Tolerance MechanismsFault-tolerant DiameterFault-tolerant Interconnection NetworksFault-tolerant NetworksGraph Theory In NetworksInterconnection Graphs
This paper investigates group graphs as a source of interconnection networks. It is shown that while these graphs possess many properties desirable in all interconnection networks, their diversity allows the generation of interconnection networks which may be optimized with regard to a variety of specific parameters. Techniques are described for generating, combining, and analyzing these graphs with respect to their order, diameter, fault tolerance, etc. A theorem is derived which shows that a large important class of group graphs are optimally fault tolerant. A number of examples are included.
11
Gian‐Carlo Rota, C. Berge · American Mathematical Monthly · 1972 · 321 citations
A Graph Model for Fault-Tolerant Computing Systems
Hayes · IEEE Transactions on Computers · 1976 · 215 citations
Distributed fault-tolerance for large multiprocessor systems
Jon G. Kuhl, S.M. Reddy · 1980 · 189 citations