This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Regular Sparse Crossbar Concentrators
March 1998 (vol. 47 no. 3)
pp. 363-368
ASCII Text
x 
 
Weiming Guo, A. Yavuz Oruç, "Regular Sparse Crossbar Concentrators," IEEE Transactions on Computers, vol. 47, no. 3, pp. 363-368, March, 1998.
 
 
BibTex
x
 
@article{ 10.1109/12.660174,
author = {Weiming Guo and A. Yavuz Oruç},
title = {Regular Sparse Crossbar Concentrators},
journal ={IEEE Transactions on Computers},
volume = {47},
number = {3},
issn = {0018-9340},
year = {1998},
pages = {363-368},
doi = {http://doi.ieeecomputersociety.org/10.1109/12.660174},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Regular Sparse Crossbar Concentrators
IS - 3
SN - 0018-9340
SP363
EP368
EPD - 363-368
A1 - Weiming Guo,
A1 - A. Yavuz Oruç,
PY - 1998
KW - Bipartite graph
KW - concentrator
KW - crosspoint complexity
KW - regular sparse crossbar.
VL - 47
JA - IEEE Transactions on Computers
ER -
 

Abstract—A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n≥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.

[1] N. Alon, “Eigenvalues and Expanders,” Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.
[2] L.A. Bassalygo, "Asymptotically Optimal Switching Circuits," Problems of Information Transactions, vol. 17, no. 3, pp. 206-211, 1981.
[3] W. Guo, "Design And Optimization of Switching Fabrics for ATM Networks and Parallel Computer Systems," doctoral dissertation, Dept. of Electrical Eng., Univ. of Maryland at College Park, Aug. 1996.
[4] C.Y. Jan and A.Y. Oruç, “Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1,469-1,479, Dec. 1993.
[5] G.M. Masson, "Binomial Switching Networks for Concentration and Distribution," IEEE Trans. Comm., vol. 25, pp. 873-883, Sept. 1977.
[6] G.A. Margulis, "Explicit Constructions of Concentrators," Problems of Information Transactions, pp. 325-332, 1973.
[7] S. Nakamura and G.M. Masson, "Lower Bounds on Crosspoint in Concentrators," IEEE Trans. Computers, vol. 31, no. 12, pp. 1,173-1,178, Dec. 1982.
[8] M. Chien and A. Oru, ”Adaptive Binary Sorting Schemes and Associated Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 6, June 1994.
[9] A.Y. Oruç and H.M. Huang, "New Results on Sparse Crossbar Concentrators," Proc. CISS, Princeton Univ., 1994.
[10] N. Pippenger, "Superconcentrators," SIAM J. Computers, vol. 6, no. 2, pp. 298-304, 1977.

Index Terms:
Bipartite graph, concentrator, crosspoint complexity, regular sparse crossbar.
Citation:
Weiming Guo, A. Yavuz Oruç, "Regular Sparse Crossbar Concentrators," IEEE Transactions on Computers, vol. 47, no. 3, pp. 363-368, March 1998, doi:10.1109/12.660174
Usage of this product signifies your acceptance of the Terms of Use.