Abstract
A network based on the hypercube, called the multiply twisted cube is proposed. This network preserves many of the desirable properties of the hypercube, but has a diameter which is only ((n+1)/2) for an n-dimensional multiple twisted cube, a reduction of nearly 50% compared to the ordinary hypercube. Some of the basic topological properties of multiply twisted cubes are discussed, and a routing algorithm which produces optimal paths is presented. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, suggests that the multiply twisted cube is an attractive alternative to the ordinary hypercube for massively parallel architectures. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
