Cart (Loading....) | Create Account
Close category search window
 

Hyper-butterfly network: a scalable optimally fault tolerant architecture

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)
Wei Shi ; Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA ; Srimani, P.K.

Bounded degree networks like deBruijn graphs or wrapped butterfly networks are very important from the VLSI implementation point of view as well as for applications where the computing nodes in the interconnection networks can have only a fixed number of I/O ports. One basic drawback of these networks is that they cannot provide a desired level of fault tolerance because of the bounded degree of the nodes. On the other hand, networks like hypercubes (where the degree of a node grows with the size of a network) can provide the desired fault tolerance but the design of a node becomes problematic for large networks. In their attempt to combine the best of both worlds, authors previously proposed hyper-deBruijn networks that have many additional features of logarithmic diameter, partitionability, embedding, etc. (Ganesan and Pradhan, 1993). However, hyper-deBruijn networks are not regular, are not optimally fault tolerant and the optimal routing is relatively complex. Our aim is to extend these concepts to propose a new family of scalable network graphs that retain all the good features of hyper-deBruijn networks and are regular and maximally fault tolerant. The optimal point to point routing algorithm is very simple

Published in:

Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998

Date of Conference:

30 Mar-3 Apr 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.