By Topic

Wormhole routing algorithms for twisted cube networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cull, P. ; Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA ; Larson, S.M.

The hypercube can be “improved” by “twisting” or rearranging edges to create new networks with smaller diameter and average distance. There are two criticisms of these twisted cube networks. First, these networks have not been shown to have deadlock-free routing algorithms. Second, while they can sometimes provide a better performance for a store-and-forward routing strategy, they have not been shown to be efficient when using a wormhole routing strategy. In this paper, we introduce a new network, the Bent Cube, and examine one recently published network, the Generalized Twisted Cube to address these issues

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994