By Topic

The clustered-star graph: a new topology for large interconnection 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
$33 $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

1 Author(s)
S. Latifi ; California Univ., Irvine, CA

The authors propose a flexible network called the clustered-star (CS) network. An (n-1)-dimensional CS of order m, denoted by CSn-1m is an n-dimensional star with (n-m) of its (n-1)-stars missing. The advantage of CSn-1m is that from the network size viewpoint, it is scalable by a factor of 1<m<n , as opposed to the (n-1)-star which is scalable only by a factor of n. Furthermore, the complete star graph with some faulty components or with some already allocated substars may result in a clustered-star network which renders the study of this new network important. Basic topological properties of CSn-1m are derived and optimal routing and broadcasting algorithms for this network are presented. It is shown that CSn-1m is hamiltonian for m=4, and m=3k, k≠2

Published in:

Parallel Processing Symposium, 1993., Proceedings of Seventh International

Date of Conference:

13-16 Apr 1993