
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rajgopal Kannan, "The KRBenes Network: A ControlOptimal Rearrangeable Permutation Network," IEEE Transactions on Computers, vol. 54, no. 5, pp. 534544, May, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.84, author = {Rajgopal Kannan}, title = {The KRBenes Network: A ControlOptimal Rearrangeable Permutation Network}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {5}, issn = {00189340}, year = {2005}, pages = {534544}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.84}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  The KRBenes Network: A ControlOptimal Rearrangeable Permutation Network IS  5 SN  00189340 SP534 EP544 EPD  534544 A1  Rajgopal Kannan, PY  2005 KW  Benes network KW  rearrangeability KW  optimal control algorithm. VL  54 JA  IEEE Transactions on Computers ER   
[1] V.E. Benes, “Optimal Rearrangeable Multistage Connecting Networks,” Bell System Technical J., vol. 43, pp. 16411656, 1964.
[2] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
[3] D. Nassimi and S. Sahni, “A SelfRouting Benes Network and Parallel Permutation Algorithms,” IEEE Trans. Computers, vol. 30, no. 5, pp. 332340, May 1981.
[4] S. Keshav, An Engineering Approach to Compter Networking. AddisonWesley, 1997.
[5] B. Prabhakar and N. McKeown, “On the Speedup Required for Combined Input and Output Queued Switching,” Automatica, vol. 35, no. 12, pp. 19091920, 1999.
[6] J. Duato and L. Ni, Interconnection Networks. Los Alamitos, Calif.: IEEE CS Press, 1999.
[7] D. Nassimi and S. Sahni, “Parallel Algorithms to Set Up the Benes Permutation Network,” IEEE Trans. Computers, vol. 31, no. 2, pp. 148154, Feb. 1982.
[8] A. Pattavina and G. Maier, “Photonic Rearrangeable Networks with Zero SwitchingElement Crosstalk,” Proc. IEEE INFOCOM 1999, pp. 337344, Apr. 1999.
[9] Y. Yang, J. Wang, and Y. Pan, “Permutation Capability of Optical Multistage Interconnection Networks,” J. Parallel and Distributed Computing, vol. 60, no. 1, pp. 7291, Jan. 2000.
[10] A. Waksman, “A Permutation Network,” J. ACM, vol. 15, no. 1, pp. 159163, Jan. 1968.
[11] K.Y. Lee, “On the Rearrangeability of ($2\log N  1$ ) Stage Permutation Networks, IEEE Trans. Computers, vol. 34, no. 5, pp. 412425, May 1985.
[12] D.C. Opferman and N.T. TsaoWu, “On a Class of Rearrangeable Switching Networks, Part I: Control Algorithm,” Bell System Technical J., vol. 50, pp. 15791600, 1971.
[13] M.K. Kim, H. Yoon, and S.R. Maeng, “BitPermute Multistage Interconnection Networks,” Microprocessing and Microprogramming, vol. 41, pp. 449468, 1995.
[14] Y.M. Yeh and T.Y. Feng, “On a Class of Rearrangeable Networks,” IEEE Trans. Computers, vol. 41, no. 11, pp. 13611379, Nov. 1992.
[15] D.M. Koppelman and A.Y. Oruc, “A SelfRouting Permutation Network,” J. Parallel and Distributed Computing, vol. 10, no. 2, pp. 140151, 1990.
[16] C. Jan and Y. Oruc, “Fast SelfRouting Permutation Switching on an Asymptotically Minimum Cost Network,” IEEE Trans. Computers, vol. 42, no. 12, pp. 13691379, Dec. 1993.
[17] H. Cam and J.A.B. Fortes, “A Fast VLSIEfficient SelfRouting Permutation Network,” IEEE Trans. Computers, vol. 44, no. 3, pp. 448453, Mar. 1995.
[18] A. Samsudin and K.Y. Lee, “nDdBPN: New SelfRouting Permutation Networks Based on the de Bruijn Digraphs,” Proc. Int'l Conf. Parallel Processing, pp. 604611, 1998.
[19] E. Lu and S.Q. Zheng, “A Fast Parallel Routing Algorithm for Benes Group Switches,” Proc. 14th IASTED Int'l Conf. Parallel and Distributed Computing and Systems, pp. 6772, Nov. 2002.
[20] S.W. Seo, T.Y. Feng, and H.I. Lee, “Permutation Realizability and Fault Tolerance Property of the InsideOut Routing Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9, pp. 946957, 1999.
[21] T.Y. Feng and S.W. Seo, “A New Routing Algorithm for a Class of Rearrangeable Networks,” IEEE Trans. Computers, vol. 43, no. 11, pp. 12701280, 1994.
[22] M.K. Kim, H. Yoon, and S.R. Maeng, “On the Correctness of InsideOut Routing Algorithm,” IEEE Trans. Computers, vol. 46, no. 7, pp. 820823, July 1997.