Shifting Graphs and Their Applications
Journal of the ACM (JACM)
Efficient message routing in Mega-Micro-Computer networks
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
The Roscoe distributed operating system
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Processor Interconnection Strategies
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
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
Software management of Cm*: a distributed multiprocessor
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
IEEE Transactions on Computers
IEEE Transactions on Computers
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
| Hi-index | 14.99 |
In this paper we describe a new family of topologies for interconnecting many identical processors to form an MIMD multiprocessor. It extends to arbitrarily many processors while keeping the number of neighbors of any one processor fixed. We show that this family behaves very well with respect to uniformity of bus load, simplicity of routing algorithms, and distance between processors.