The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
The Roscoe distributed operating system
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Parallel Processing with the Perfect Shuffle
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
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Families of Fixed Degree Graphs for Processor Interconnection
IEEE Transactions on Computers
IEEE Transactions on Computers
Large Graphs with Given Degree and Diameter Part I
IEEE Transactions on Computers
| Hi-index | 14.99 |
This paper presents a new family of undirected graphs that allows N processors to be connected in a network of diameter 3/2 log2 N + O(1), while only requiring that each processor be connected to three neighbors. The best trivalent graphs previously proposed require a diameter of 2 log2N + O(1).