Generalized Hypercube and Hyperbus Structures for a Computer Network
Bhuyan, Agrawal · IEEE Transactions on Computers · 1984
A general class of hypercube structures is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. The interconnection is based on a mixed radix number system and the technique results in a variety of hypercube structures for a given number of processors N, depending on the desired diameter of the network. A cost optimal realization is obtained through a process of discrete optimization. The performance of such a structure is compared to that of other existing hypercube structures such as Boolean n-cube and nearest neighbor mesh computers.
Cited by 855 works. doi:10.1109/tc.1984.1676437
Authors
References
- Parallel Processing with the Perfect Shuffle
- A Survey of Interconnection Networks
- The cube-connected cycles: a versatile network for parallel computation
- C.mmp
- A large scale, homogeneous, fully distributed parallel machine, I
- A large scale, homogeneous, fully distributed parallel machine, I
- Queueing Systems, Vol. II: Computer Applications.
- Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
- X-Tree
- Queueing Systems. Vol. II—Computer Applications