By Topic

Comparing the performance parameters of two network structures for scalable massively parallel processors

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)
Ding-Ming Kwai ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA ; B. Parhami

Packed exponential connection (PEC) networks and periodically regular chordal (PRC) rings, proposed as enhanced versions of linear arrays and rings respectively introduce skip links into the respective base networks. Both networks can be viewed as derivatives of symmetric chordal rings with restricted or reduced connection assignments. Thus, an interesting question arises: How can one prune or thin the connections of a given network to a prescribed degree such that the key network properties are still acceptable? We show the hierarchical arrangements and grouping strategies on which PEC networks and PRC rings are based and examine their effects on expandability, ease of implementation, network diameter, and routing schemes

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96., Proceedings of the Fourth International Workshop on

Date of Conference:

1-3 Feb 1996