Regular sparse crossbar concentrators

被引:10
作者
Guo, WM [1 ]
Oruc, AY [1 ]
机构
[1] Univ Maryland, Dept Elect Engn, College Pk, MD 20742 USA
基金
美国国家科学基金会;
关键词
bipartite graph; concentrator; crosspoint complexity; regular sparse crossbar;
D O I
10.1109/12.660174
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n greater than or equal to m inputs to its m outputs, possibly without the ability to distinguish their order. Fat-and-slim crossbars were introduced recently to show that bipartite concentrators can be constructed with a minimum number of crosspoints for any number of inputs and outputs. We generalize these graphs to obtain bipartite concentrators with nearly a fixed fanout without altering their (n - m + 1)m crosspoint complexity. We also present an O(log n)-time algorithm to route arbitrary concentration assignments on this new family of fat-and-slim crossbars.
引用
收藏
页码:363 / 368
页数:6
相关论文
共 10 条
[1]   EIGENVALUES AND EXPANDERS [J].
ALON, N .
COMBINATORICA, 1986, 6 (02) :83-96
[2]  
Bassalygo L. A., 1981, Problems of Information Transmission, V17, P206
[3]   ADAPTIVE BINARY SORTING SCHEMES AND ASSOCIATED INTERCONNECTION NETWORKS [J].
CHIEN, MV ;
ORUC, AY .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (06) :561-572
[4]  
GUO W, 1996, THESIS U MARYLAND CO
[5]  
JAN CY, 1993, IEEE T COMPUT, V42, P1469, DOI 10.1109/12.260636
[6]  
Margulis G. A., 1973, Problems of Information Transmission, V9, P325
[7]   BINOMIAL SWITCHING NETWORKS FOR CONCENTRATION AND DISTRIBUTION [J].
MASSON, GM .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (09) :873-883
[8]  
NAKAMURA S, 1982, IEEE T COMPUT, V31, P1173, DOI 10.1109/TC.1982.1675941
[9]  
ORUC AY, 1994, P CISS PRINC U
[10]  
Pippenger N., 1977, SIAM Journal on Computing, V6, P298, DOI 10.1137/0206022