This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing Algorithms on the Bus-Based Hypercube Network
April 2005 (vol. 16 no. 4)
pp. 335-348

Abstract—In this paper, we study the properties of the bus-based hypercube, denoted as U(n,b), which is a kind of multiple-bus networks (MBN). U(n,b) consists of 2^{n} processors and 2^{b} buses, where 0\leq b\leq n-1, and each processor is connected to either \lceil{\frac{b+2}{2}}\rceil or \lceil{\frac{b+1}{2}}\rceil buses. We show that the diameter of U(n,b) is \lceil{\frac{b+1}{2}}\rceil if b\geq2. We also present an algorithm to select the best neighbor processor via which we can obtain one shortest routing path. In U(n,b), we show that if there exist some faults, the fault diameter DF(n,b,f)\leq b+1, where f is the sum of bus faults and processor faults and 0\leq f\leq\lceil{\frac{b-3}{2}}\rceil. Furthermore, we also show that the bus-fault diameter DB(n,b,f)\leq\lfloor{\frac{b}{2}}\rfloor+3, where 0\leq f\leq\lceil{\frac{b-1}{2}}\rceil and f is the number of bus faults. These results improve significantly the previous result that DB(n,b,f)\leq b+2f+1, where f is the number of bus faults.

[1] A. Ali and R. Vaidyanathan, “Exact Bounds n Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 783-790, 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. 323-333, Apr. 1984.
[3] J. Bruck, R. Cypher, and C. Ho, “On the Construction of Fault-Tolerant Cube-Connected Cycles Networks,” J. Parallel and Distributed Computing, vol. 25, pp. 98-106, 1995.
[4] Y.C. Chen, “Designing Efficient Parallel Algorithms on Mesh-Connected Computers with Multiple Broadcasting,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 241-246, 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. 84-90, 1996.
[6] H.P. Dharmasena and R. Vaidyanathan, “Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms,” Proc. 13th Int'l and 10th Symp. Parallel and Distributed Processing, IPPS/SPDP, pp. 21-25, 1999.
[7] O.M. Dighe, R. Vaidyanathan, and S. Zheng, “Bus-Based Tree Structure for Efficeint Parallel Computation,” Proc. 1993 Int'l Conf. Parallel Processing, pp. 158-161, 1993.
[8] O.M. Dighe, R. Vaidyanathan, and S. Zheng, “The Bus-Connected Ringed Tree: A Versatile Interconnection Network,” J. Parallel and Distributed Computing, vol. 33, pp. 189-196, 1996.
[9] P.W. Dowd and K. Jabbour, “Spanning Multiaccess Channel Hypercube Computer Interconnection,” IEEE Trans. Computers, vol. 37, pp. 1137-1142, 1988.
[10] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, “The Twisted N-Cube with Application to Multiprocessing,” IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, 1991.
[11] L.C. Fan, “Routing Algorithms on the Bus-Based Hypercube Network,” MS thesis, Nat'l Sun Yat-sen Univ., Kaohsiung, Taiwan 804, 1997.
[12] C.M. Fiduccia, “Bused Hypercube and Other Pin-Optimal Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 1, pp. 14-24, Jan. 1992.
[13] T. Ishikawa, “CCT-Cube: A Highly Parallel Network Featuring Short Diameter and Few Links,” Inst. of Electronics, Information and Comm. Engineers, vol. J73-D-I, no. 6, pp. 559-602, 1990.
[14] T. Ishikawa, “Hypecube Multilprocessor with Bus Connections for Improving Communication Performance,” IEEE Trans. Computers, vol. 44, no. 11, pp. 1338-1344, 1995.
[15] K. Jungjoon and A. El-Amawy, “Performance and Architectural Features of Segmented Multiple Bus System,” Proc. Int'l Conf. Parallel Processing, pp. 154-160, 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. EI-Amawy, “Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems,” IEEE Trans. Computers, vol. 45, pp. 964-969, 1996.
[18] Y. Lan, “Adaptive Fault-Tolerant Multicast in Hypercube Multiprocessors,” J. Parallel and Distributed Computing, vol. 23, pp. 80-93, 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. 320-333, 2000.
[20] T.C. Lee and J.P. Hayes, “A Fault-Tolerant Communication Scheme for Hypercube Computers,” IEEE Trans. Computers, vol. 41, no. 10, pp. 1242-1256, Oct. 1992.
[21] Y. Leu and S. Kuo, “A Fault-Tolerant Tree Communication Scheme for Hypercube Systems,” IEEE Trans. Computers, vol. 45, no. 6, pp. 641-650, 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. 1241-1252, 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. 497-512, 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. Prasanna-Kumar, D. Reisis, and Q. Stout, “Parallel Computations on Reconfigurable Meshes,” IEEE Trans. Computers, vol. 42, pp. 678-692, June 1993.
[26] F.P. Preparata and J. Vullemin, “The Cube Connected Cycles: A Versatite Network for Parallel Computation,” Comm. ACM, vol. 24, pp. 300-309, May 1981.
[27] Y. Saad and M.H. Schultz, “Topological Properties of Hypercubes,” IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[28] M.J. Serrano and B. Parhami, “Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 1073-1080, 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. 82-94, 1996.
[30] N.F. Tzeng and S. Wei, “Enhance Hypercubes,” IEEE Trans. Computers, vol. 40, pp. 284-294, 1991.
[31] R. Vaidyanathan, “Sorting on Prams with Reconfiguable Buses,” Information Processing Letters, vol. 42, pp. 203-208, June 1992.
[32] R. Vaidyanathan and A. Padmanabhan, “Bus-Based Networks for Fan-In and Uniform Hypercube Algorithms,” Parallel Computing, vol. 21, pp. 1807-1821, 1995.
[33] B. Wilkinson, “Multiple Bus with Overlapping Connectivity,” IEE Proc. -E, vol. 138, no. 4, pp. 281-284, July 1991.
[34] B. Wilkinson, “On Crossbar Switch and Multiple Bus Interconnection Networks with Overlapping Connectivity,” IEEE Trans. Computers, vol. 41, no. 6, pp. 738-746, June 1992.
[35] L.D. Wittie, “Communication Structures for Large Networks of Microcomputers,” IEEE Trans. Computers, vol. 30, no. 4, pp. 264-273, Apr. 1981.

Index Terms:
Multiple-bus network, hypercube, routing algorithm, diameter, fault tolerance.
Citation:
Lee-Juan Fan, Chang-Biau Yang, Shyue-Horng Shiau, "Routing Algorithms on the Bus-Based Hypercube Network," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 4, pp. 335-348, April 2005, doi:10.1109/TPDS.2005.49
Usage of this product signifies your acceptance of the Terms of Use.