DocumentCode
1317946
Title
Novel algorithm for Clos-type networks
Author
Gordon, J. ; Srikanthan, S.
Author_Institution
Zergo Ltd., Hemel Hempstead, UK
Volume
26
Issue
21
fYear
1990
Firstpage
1772
Lastpage
1774
Abstract
A new routing algorithm for controlling nonblocking Clos-type permutation networks is presented. Unlike previous algorithms based on matrix decomposition and looping techniques, the algorithm uses a new method called scheduling, does not use iterations, and has execution time 0(Nr12/) where N is the total number of ports, and r is the number of first-stage switches.
Keywords
circuit layout; network analysis; switching networks; execution time; first-stage switches; looping techniques; matrix decomposition; nonblocking Clos-type permutation networks; routing algorithm; scheduling; switching networks;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19901138
Filename
83105
Link To Document