DocumentCode
1155520
Title
A New Benes Network Control Algorithm
Author
Lee, Kyungsook Yoon
Author_Institution
Department of Computer and Information Science, The Ohio State University
Issue
6
fYear
1987
fDate
6/1/1987 12:00:00 AM
Firstpage
768
Lastpage
772
Abstract
A new Benes network control algorithm is presented. Unlike the original looping algorithm, the new algorithm is not recursive. In this algorithm (N x N) Benes network is viewed as a concatenation of two subnetworks SN1 and SN2. The first (log N - 1) stages of a Benes network correspond to SN1, and the remaining log N stages correspond to SN2. SN1 is controlled by a full binary tree of set partitioning functions, called a Complete Residue Partition Tree, and SN2 is bit controlled. The new control algorithm sets switches one stage at a time, stage by stage.
Keywords
Benes network; bit control; control algorithm; permutation; rearrangeable network; set partition; subnetwork; Binary trees; Hardware; Information science; Intelligent networks; Multiprocessor interconnection networks; Partitioning algorithms; Switches; US Department of Energy; Very large scale integration; Benes network; bit control; control algorithm; permutation; rearrangeable network; set partition; subnetwork;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1987.1676970
Filename
1676970
Link To Document