
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
SeungWoo Seo, TseYun Feng, "The Composite Banyan Network," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 10431054, October, 1995.  
BibTex  x  
@article{ 10.1109/71.473514, author = {SeungWoo Seo and TseYun Feng}, title = {The Composite Banyan Network}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {10}, issn = {10459219}, year = {1995}, pages = {10431054}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.473514}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  The Composite Banyan Network IS  10 SN  10459219 SP1043 EP1054 EPD  10431054 A1  SeungWoo Seo, A1  TseYun Feng, PY  1995 KW  Interconnection networks KW  composite banyan network KW  topologydescribing functions KW  primary and alternate routing tags KW  binary weights KW  permutation routing algorithm. VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] L. R. Goke and G. J. Lipovski,“Banyan networks for partitioning multiprocessor systems,”inFirst Ann. Symp. Comput. Archit., 1973, pp. 21–28.
[2] C.L. Wu and T. Feng,“On a class of multistage interconnection networks,” IEEE Trans. Computers, vol. 29, pp. 694702, Aug. 1980.
[3] D.H. Lawrie,“Access and alignment of data in an array processor,” IEEE Trans. Computers, vol. 24, pp. 1,1451,155, Dec. 1975.
[4] T. Feng,“Data manipulating functions in parallel processors and implementations,” IEEE Trans. Computers, vol. 23, pp. 309318, Mar. 1974.
[5] K.E. Batcher,“The flip network in STARAN,” Proc. Int’l Conf. Parallel Processing, pp. 6571, 1976.
[6] V. Benes,Mathematical Theory of Connecting Networks.New York: Academic Press, 1965.
[7] D.C. Opferman and N.T. TsaoWu,“On a class of rearrangeable switching networks,” Bell System Technical J., vol. 50, no. 5, pp. 1,5791,600, May/June, 1971.
[8] G.B. Adams,D.P. Agarwal, and H.J. Siegel,"FaultTolerant Multistage Interconnection Networks," Computer, pp. 1427, June 1987.
[9] G.B. Adams III and H.J. Siegel,“The extra stage cube: A fault tolerant interconnection network forsupersystems,” IEEE Trans. Computers, vol. 31, pp. 443454, May 1982.
[10] N.F. Tzeng, P.C. Yew, and C.Q. Zhu, “A FaultTolerant Scheme for Multistage Interconnection Networks,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 368375, 1985.
[11] V.P. Kumar and S.M. Reddy,"Augmented ShuffleExchange Multistage Interconnection Networks," Computer, pp. 3040, June 1987.
[12] K. Padmanabhan and D.H. Lawrie,“A class of redundant path multistage interconnection networks,” IEEE Trans. Computers., vol. 32, pp. 1,0991,107, Dec. 1983.
[13] R.J. McMillen and H.J. Siegel,“Routing schemes for augmented data manipulator network in an MIMD system,” IEEE Trans. Computers, vol. 31, pp. 1,2021,214, Dec. 1982.
[14] D.S. Parker and C.S. Raghavendra,“The gamma network,” IEEE Trans. Computers, vol. 33, pp. 367373, Apr. 1984
[15] C.S. Raghavendra and A. Varma,“Faulttolerant multiprocessors with redundantpath interconnection networks,” IEEE Trans. Computers, vol. 35, No. 4, Apr. 1986.
[16] A. Varma and C.S. Raghavendra,“On permutations passable by the gamma network,” J. Parallel and Distributed Computing, vol. 3, pp. 7291, 1986.
[17] C.P. Kruskal and M. Snir,“The performance of multistage interconnection networks for multiprocessors,” IEEE Trans. Computers, vol. 32, pp. 1,0911,098, Dec. 1983.