
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
LeeJuan Fan, ChangBiau Yang, ShyueHorng Shiau, "Routing Algorithms on the BusBased Hypercube Network," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 4, pp. 335348, April, 2005.  
BibTex  x  
@article{ 10.1109/TPDS.2005.49, author = {LeeJuan Fan and ChangBiau Yang and ShyueHorng Shiau}, title = {Routing Algorithms on the BusBased Hypercube Network}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {16}, number = {4}, issn = {10459219}, year = {2005}, pages = {335348}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.49}, 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  Routing Algorithms on the BusBased Hypercube Network IS  4 SN  10459219 SP335 EP348 EPD  335348 A1  LeeJuan Fan, A1  ChangBiau Yang, A1  ShyueHorng Shiau, PY  2005 KW  Multiplebus network KW  hypercube KW  routing algorithm KW  diameter KW  fault tolerance. VL  16 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we study the properties of the busbased hypercube, denoted as
[1] A. Ali and R. Vaidyanathan, “Exact Bounds n Running ASCEND/DESCEND and FANIN Algorithms on Synchronous Multiple Bus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 783790, Aug. 1996.
[2] L.N. Bhuyan and D.P. Agrawal, “Generalized Hypercube and the Hyperbus Structures for a Computer Network,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[3] J. Bruck, R. Cypher, and C. Ho, “On the Construction of FaultTolerant CubeConnected Cycles Networks,” J. Parallel and Distributed Computing, vol. 25, pp. 98106, 1995.
[4] Y.C. Chen, “Designing Efficient Parallel Algorithms on MeshConnected Computers with Multiple Broadcasting,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 241246, Apr. 1990.
[5] S. Cheung and F.C.M. Lau, “Routing with Locality on Meshes with Buses,” J. Parallel and Distributed Computing, vol. 33, pp. 8490, 1996.
[6] H.P. Dharmasena and R. Vaidyanathan, “Lower Bounds on the Loading of Degree2 Multiple Bus Networks for BinaryTree Algorithms,” Proc. 13th Int'l and 10th Symp. Parallel and Distributed Processing, IPPS/SPDP, pp. 2125, 1999.
[7] O.M. Dighe, R. Vaidyanathan, and S. Zheng, “BusBased Tree Structure for Efficeint Parallel Computation,” Proc. 1993 Int'l Conf. Parallel Processing, pp. 158161, 1993.
[8] O.M. Dighe, R. Vaidyanathan, and S. Zheng, “The BusConnected Ringed Tree: A Versatile Interconnection Network,” J. Parallel and Distributed Computing, vol. 33, pp. 189196, 1996.
[9] P.W. Dowd and K. Jabbour, “Spanning Multiaccess Channel Hypercube Computer Interconnection,” IEEE Trans. Computers, vol. 37, pp. 11371142, 1988.
[10] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, “The Twisted NCube with Application to Multiprocessing,” IEEE Trans. Computers, vol. 40, no. 1, pp. 8893, 1991.
[11] L.C. Fan, “Routing Algorithms on the BusBased Hypercube Network,” MS thesis, Nat'l Sun Yatsen Univ., Kaohsiung, Taiwan 804, 1997.
[12] C.M. Fiduccia, “Bused Hypercube and Other PinOptimal Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 1, pp. 1424, Jan. 1992.
[13] T. Ishikawa, “CCTCube: A Highly Parallel Network Featuring Short Diameter and Few Links,” Inst. of Electronics, Information and Comm. Engineers, vol. J73DI, no. 6, pp. 559602, 1990.
[14] T. Ishikawa, “Hypecube Multilprocessor with Bus Connections for Improving Communication Performance,” IEEE Trans. Computers, vol. 44, no. 11, pp. 13381344, 1995.
[15] K. Jungjoon and A. ElAmawy, “Performance and Architectural Features of Segmented Multiple Bus System,” Proc. Int'l Conf. Parallel Processing, pp. 154160, 1999.
[16] S.T. Kamath, “Running Weak Hypercube Algorithms on Multiple Bus Networks,” MS Thesis, Louisiana State Univ., Baton Rouge, LA, 1996.
[17] P. Kulasinghe and A. EIAmawy, “Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems,” IEEE Trans. Computers, vol. 45, pp. 964969, 1996.
[18] Y. Lan, “Adaptive FaultTolerant Multicast in Hypercube Multiprocessors,” J. Parallel and Distributed Computing, vol. 23, pp. 8093, 1994.
[19] K.Y. Lee, G. Liu, and H.F. Jordan, “TDM Hypercube and TWDM Mesh Optical Interconnections,” J. Parallel and Distributed Computing, vol. 60, pp. 320333, 2000.
[20] T.C. Lee and J.P. Hayes, “A FaultTolerant Communication Scheme for Hypercube Computers,” IEEE Trans. Computers, vol. 41, no. 10, pp. 12421256, Oct. 1992.
[21] Y. Leu and S. Kuo, “A FaultTolerant Tree Communication Scheme for Hypercube Systems,” IEEE Trans. Computers, vol. 45, no. 6, pp. 641650, June 1996.
[22] A. Louri and C. Neocleous, “A Spanning Bus Connected Hypercube: A New Scalable Optical Interconnection Network for Multiprocessors and Massively Parallel Systems,” J. Lightwave Technology, vol. 15, no. 7, pp. 12411252, July 1997.
[23] A. Louri, B. Weech, and C. Neocleous, “A Spanning Multichannel Linked Hypercube: A Gradually Scalable Optical Interconnection Network for Massively Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 5, pp. 497512, May 1998.
[24] H.M. Alnuwieri, M. Alimuddin, and H. Aljunaidi, “Switch Models and Reconfigurable Networks: Tutorial and Partial Survey,” Proc. First Workshop Reconfigurable Architectures, 1994.
[25] R. Miller, V.K. PrasannaKumar, D. Reisis, and Q. Stout, “Parallel Computations on Reconfigurable Meshes,” IEEE Trans. Computers, vol. 42, pp. 678692, June 1993.
[26] F.P. Preparata and J. Vullemin, “The Cube Connected Cycles: A Versatite Network for Parallel Computation,” Comm. ACM, vol. 24, pp. 300309, May 1981.
[27] Y. Saad and M.H. Schultz, “Topological Properties of Hypercubes,” IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[28] M.J. Serrano and B. Parhami, “Optimal Architectures and Algorithms for MeshConnected Parallel Computers with Separable Row/Column Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 10731080, Oct. 1993.
[29] J.L. Trahan, R. Vaidyanathan, and R.K. Thiruchelvan, “On the Power of Segmenting and Fusing Buses,” J. Parallel and Distributed Computing, vol. 34, pp. 8294, 1996.
[30] N.F. Tzeng and S. Wei, “Enhance Hypercubes,” IEEE Trans. Computers, vol. 40, pp. 284294, 1991.
[31] R. Vaidyanathan, “Sorting on Prams with Reconfiguable Buses,” Information Processing Letters, vol. 42, pp. 203208, June 1992.
[32] R. Vaidyanathan and A. Padmanabhan, “BusBased Networks for FanIn and Uniform Hypercube Algorithms,” Parallel Computing, vol. 21, pp. 18071821, 1995.
[33] B. Wilkinson, “Multiple Bus with Overlapping Connectivity,” IEE Proc. E, vol. 138, no. 4, pp. 281284, July 1991.
[34] B. Wilkinson, “On Crossbar Switch and Multiple Bus Interconnection Networks with Overlapping Connectivity,” IEEE Trans. Computers, vol. 41, no. 6, pp. 738746, June 1992.
[35] L.D. Wittie, “Communication Structures for Large Networks of Microcomputers,” IEEE Trans. Computers, vol. 30, no. 4, pp. 264273, Apr. 1981.