By Topic

On a class of concatenated (2log2N-1)-stage 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
$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

3 Author(s)
Yanggon Kim ; Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA ; Tse-Yun Feng ; Seung-Woo Seo

This paper investigates topological properties of a class of concatenated (2log2N-1)-stage interconnection networks and introduces their interstage correlations. A concatenated (2log2 N-1)-stage interconnection network is constructed by merging two (log2N)-stage cube-type networks with overlapped center stages. In constructing concatenated (2log2N-1)-stage interconnection networks, we consider all self-routable (log2N)-stage cube-type networks which can establish a path to an output port with a self-routing tag. Each routing tag for a cube-type network can be generated by reordering destination address bits using a bit permutation mapping function. Based on two bit-reordering mapping functions for a given (2log2N-1)-stage interconnection network, we formulate its interstage correlations into an algebraic function. Then, the topological equivalences among concatenated (2log2N-1)-stage interconnection networks are introduced. The proposed classification scheme implies that any two concatenated networks in the same class are topologically equivalent and have isomorphic interstage correlation functions. This means that all the concatenated networks in the same class can use the same routing and application algorithms. In addition, several related important characteristics of each class are discussed. We expect that the results of this paper provide us with an important background for developing a graphical representation model and a bidirectional tag scheme

Published in:

Parallel Architectures, Algorithms, and Networks, 1996. Proceedings., Second International Symposium on

Date of Conference:

12-14 Jun 1996