A reconfigurable and fault-tolerant VLSI multiprocessor array
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI
IEEE Transactions on Computers
A Graph Model for Fault-Tolerant Computing Systems
IEEE Transactions on Computers
Fault Diagnosis in a Boolean n Cube Array of Microprocessors
IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
A Fault-Tolerant Communication Architecture for Distributed Systems
IEEE Transactions on Computers
The cube-connected-cycles: A versatile network for parallel computation
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Group graphs and computational symmetry on massively parallel architecture
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Small Diameter Symmetric Networks From Linear Groups
IEEE Transactions on Computers
Cayley Graphs With Optimal Fault Tolerance
IEEE Transactions on Computers
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
IEEE Transactions on Parallel and Distributed Systems
Discrete Mathematics - Algebraic and topological methods in graph theory
Fault tolerance on star graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Paths to stardom: calibrating the potential of a peer-based data management system
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Fault Tolerance in the Biswapped Network
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 14.99 |
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.