By Topic

Equivalence between SP2 high-performance switches and three-stage Clos 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

2 Author(s)
ten Bruggencate, M. ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA ; Chalasani, S.

In this paper we prove the functional equivalence of SP2 switches and rearrangeable three-stage Clos networks. From this equality we derive results on routing communications in SP2 switches. The present an algorithm using centralized control which can route any permutation in one pass through SP2 switches, for various system sizes. Further, we present a distributed control algorithm which can route the important class of linear-complement permutations through SP2 switches. Our results not only highlight the capabilities of SP2 switches, but also demonstrate how to efficiently route permutations at the application level

Published in:

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on  (Volume:1 )

Date of Conference:

12-16 Aug 1996