Issue No. 07 - July (1987 vol. 36)
S.B. Akers , Department of Electrical and Computer Engineering, University of Massachusetts
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.
processor arrays, Distributed architectures, fault-tolerant networks, group graphs, interconnection networks, node-symmetric graphs
B. Krishnamurthy and S. Akers, "On Group Graphs and Their Fault Tolerance," in IEEE Transactions on Computers, vol. 36, no. , pp. 885-888, 1987.