A new decomposition algorithm for rearrangeable Clos interconnection networks

We give a new decomposition algorithm to route a rearrangeable three-stage Clos network in O(nr/sup 2/) time, which is faster than all existing decomposition algorithms. By performing a row-wise matrix decomposition, this algorithm routes all possible permutations, thus overcoming the limitation on...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1996-11, Vol.44 (11), p.1572-1578
Main Authors: Hyun Yeop Lee, Hwang, F.K., Carpinelli, J.D.
Format: Article
Language:English
Subjects:
Communication switching
Computational complexity
Computer networks
Fabrics
Fault tolerance
Matrix decomposition
Multiprocessor interconnection networks
Routing
Switches
Very large scale integration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give a new decomposition algorithm to route a rearrangeable three-stage Clos network in O(nr/sup 2/) time, which is faster than all existing decomposition algorithms. By performing a row-wise matrix decomposition, this algorithm routes all possible permutations, thus overcoming the limitation on realizable permutations exhibited by many other routing algorithms. This algorithm is extended to the fault tolerant Clos network which has extra switches in each stage, where it provides fault tolerance under faulty conditions and reduces routing time under submaximal fault conditions.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.544474