Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
ACM Computing Surveys (CSUR)
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Improved Construction Techniques for (d, k) Graphs
IEEE Transactions on Computers
Topological constraints on interconnection-limited logic
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
On Moore graphs with diameters 2 and 3
IBM Journal of Research and Development
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
IEEE Transactions on Computers
| Hi-index | 14.98 |
As a result of recent technological developments there is an increasing interest in the interconnection of microcomputers through networks. For general computation the interconnection graphs should have short internode communication paths and should be of low degree, systematically structured, and incrementally extensible. A family of graphs, called multitree structured (MTS) having these properties is presented. The MTS graphs of degree three have the maximum number of nodes, known to date, for given diameters.