By Topic

Incomplete star graph: an alternative interconnection network for massively parallel systems

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

2 Author(s)

The authors introduce a new interconnection network for massively parallel systems called the incomplete star graph. They describe unique ways of interconnecting and labeling the nodes, and routing point-to-point communications within this network. A special class of the incomplete star graph is presented and the network measures for this special class are derived. An n-dimensional star graph increases by a factor of (n+1)>2 every time it grows to the next dimension. One of the main contributions is the development of a selection method for designing an m-processor network with (n-1)-factorial<m<n-factorial out of n-factorial possible permutations

Published in:

System Sciences, 1993, Proceeding of the Twenty-Sixth Hawaii International Conference on  (Volume:ii )

Date of Conference:

5-8 Jan 1993