This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Exchanged Hypercube
September 2005 (vol. 16 no. 9)
pp. 866-874

Abstract—This paper presents the Exchanged Hypercube, a new interconnection network obtained by systematically removing links from a binary hypercube. It maintains several desirable properties of the binary hypercube yet with reduced interconnection complexity. We also introduce the Extended Binomial Tree, a spanning tree of the Exchanged Hypercube that preserves many desirable properties of the original Binomial Tree. A fault-tolerant routing strategy is also proposed for the Exchanged Hypercube.

[1] M.-S. Chen and K.G. Shin, “Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 152-159, Apr. 1990.
[2] M.S. Chen and K.G. Shin, “Adaptive Fault-Tolerant Routing in Hypercube Multicomputers,” IEEE Trans. Computers, vol. 39, no. 12, pp. 1406-1416, Dec. 1990.
[3] W.-K. Chen and M.F.M. Stallmann, “On Embedding Binary Trees into Hypercubes,” J. Parallel and Distributed Computing, vol. 24, pp. 132-138, 1995.
[4] W.J. Dally and C. Seitz, “Deadlock Free Message Routing In Multiprocessor Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
[5] A. Dolan and J. Aldous, Networks and Algorithms. John Wiley and Sons, 1993.
[6] D.B. West, Introduction to Graph Theory, second ed. Prentice Hall, 2001.
[7] M.D. Grammatikakis, F.D. Hsu, and M. Hraetzl, Parallel System Interconnection and Communications. CRC Press, 2001.
[8] W.J. Hsu, “Fibonacci Cubes-A New Interconnection Topology,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 1, pp. 3-12, Jan. 1993.
[9] W.J. Hsu, M.J. Chung, and Z. Hu, “Gaussian Networks for Scalable Distributed Systems,” The Computer J., vol. 39, no. 5, pp. 417-426, 1996.
[10] K. Kennedy, C.F. Bender, J.W.D. Connolly, J.L. Hennesy, M.K. Vernon, and L. Smarr, “A Nationwide Parallel Computing Environment,” Comm. ACM-Blueprint for the Future of High-Performance Computing, vol. 40, no. 11, pp. 63-72, Nov. 1997.
[11] A. Kumar, S. Merugu, J. Xu, and X. Yu, “Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network,” Proc. IEEE Int'l Conf. Network Protocols, Nov. 2003.
[12] S. Lakshmivarahan and S.K. Dhall, Analysis and Design of Parallel Algorithms. McGraw-Hill Int'l, 1990.
[13] Y. Lan, “An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 11, pp. 1147-1152, Nov. 1995.
[14] 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.
[15] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
[16] J. Liu, W.J. Hsu, and M.J. Chung, “Generalized Fibonacci Cubes are Mostly Hamiltonian,” J. Graph Theory, vol. 18, no. 8, pp. 817-829, 1994.
[17] P.K.K. Loh and W.J. Hsu, “Fault-Tolerant Communications on Hypercube-Clusters,” J. Interconnection Networks, vol. 1, no. 4, pp. 315-329, Dec. 2000.
[18] P.K.K. Loh, H. Schröder, and W.J. Hsu, “Fault-Tolerant Routing on Complete Josephus Cubes,” Proc. Sixth Australasian Conf. Computer Systems Architecture, pp. 95-104, 2001.
[19] P. Messina, D. Culler, W. Pfeiffer, W. Martin, J.T. Oden, and G. Smith, “Architecture,” Comm. ACM, vol. 41, no. 11, pp. 36-44, Nov. 1998.
[20] F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks,” Proc. Seventh Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 119-128, 1995.
[21] Y. Pan, “Properties and Performance of the Block Shift Network,” IEEE Trans. Circuits and Systems, vol. 44, no. 2, pp. 93-102, Feb. 1997.
[22] Y. Saad and M.H. Schultz, “Topological Properties of the Hypercubes,” IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[23] R.L. Sharma, Network Topology OptimizationThe Art and Science of Network Design. Van Nostrand Reinhold, 1990.
[24] N.-F. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 40, no. 3, pp. 284-294, Mar. 1991.
[25] J. Wu, “Reliable Unicasting in Faulty Hypercubes Using Safety Levels,” IEEE Trans. Computers, vol. 46, no. 2, pp. 241-247, Feb. 1997.
[26] J. Xu, A. Kumar, and X. Yu, “On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in P2P Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 151-163, Jan. 2004.
[27] S.G. Ziavras, “RH: A Versatile Family of Reduced Hypercube Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1210-1220, Nov. 1994.

Index Terms:
Hypercube, network, topology, spanning tree, fault tolerance.
Citation:
Peter K.K. Loh, Wen Jing Hsu, Yi Pan, "The Exchanged Hypercube," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 9, pp. 866-874, Sept. 2005, doi:10.1109/TPDS.2005.113
Usage of this product signifies your acceptance of the Terms of Use.