On Group Graphs and Their Fault Tolerance
- 1 July 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (7) , 885-888
- https://doi.org/10.1109/tc.1987.1676983
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- On Area and Yield Considerations for Fault-Tolerant VLSI Processor ArraysIEEE Transactions on Computers, 1984
- A Fault-Tolerant Communication Architecture for Distributed SystemsIEEE Transactions on Computers, 1982
- Some New Results About the (d, k) Graph ProblemIEEE Transactions on Computers, 1982
- High density graphs for processor interconnectionInformation Processing Letters, 1981
- The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSIIEEE Transactions on Computers, 1981
- Distributed fault-tolerance for large multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1980
- The cube-connected-cycles: A versatile network for parallel computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969