|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| R.a. Ayoubi, Q.m. Malluhi, M.a. Bayoumi, "The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems," IEEE Transactions on Computers, vol. 45, no. 5, pp. 609-614, May, 1996. | |||
| BibTex | x | ||
| @article{ 10.1109/12.509913, author = {R.a. Ayoubi and Q.m. Malluhi and M.a. Bayoumi}, title = {The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {5}, issn = {0018-9340}, year = {1996}, pages = {609-614}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.509913}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems IS - 5 SN - 0018-9340 SP609 EP614 EPD - 609-614 A1 - R.a. Ayoubi, A1 - Q.m. Malluhi, A1 - M.a. Bayoumi, PY - 1996 KW - Hypercube KW - cube connected cycles KW - routing KW - broadcasting KW - interconnection network KW - divide and conquer. VL - 45 JA - IEEE Transactions on Computers ER - | |||
Abstract—The hypercube structure is a very widely used interconnection topology because of its appealing topological properties. For massively parallel systems with thousands of processors, the hypercube suffers from a high node fanout which makes such systems impractical and infeasible. In this paper, we introduce an interconnection network called The Extended Cube Connected Cycles (ECCC) which is suitable for massively parallel systems. In this topology the processor fanout is fixed to four. Other attractive properties of the ECCC include a diameter of logarithmic order and a small average interprocessor communication distance which imply fast data transfer. The paper presents two algorithms for data communication in the ECCC. The first algorithm is for node-to-node communication and the second is for node-to-all broadcasting. Both algorithms take O(log
[1] V. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic.New York: Academic Press, 1965.
[2] K.V. Bhat,"On Properties of Arbitrary Hypercubes," Comp,&Maths with Appls., vol. 8, no. 1, pp. 31-42, 1982.
[3] S.P. Dandamudi and D.L. Eager, "Hierarchical Interconnection Networks for Multicomputer Systems," IEEE Trans. Computers, pp. 786-797, 1990.
[4] A. El-Amawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.
[5] C.M. Fiduccia,“Bused hypercubes and other pin-optimal networks,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 14-24, 1992.
[6] K. Hwang and J. Ghosh, "Hypernet: A Communication Efficient Architecture for Constructing Massively Parallel Computers," IEEE Trans. Computers, pp. 1,450-1,466, 1987.
[7] O.H. Ibarra and S.M. Sohn, "On Mapping Systolic Algorithms onto the Hypercube," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, pp. 48-63, Jan. 1990.
[8] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[9] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[10] J.M. Kumar and L.M. Patnaik, "Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes," IEEE Trans. Parallel and Distributed Systems, pp. 45-57, 1992.
[11] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[12] Q.M. Malluhi and M.A. Bayoumi, "The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 17-30, Jan. 1994.
[13] Y. Saad and M.H. Schultz, "Data Communication in Hypercubes," J. Parallel and Distributed Computing, vol. 6, pp. 115-135, 1989.
[14] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[15] H.S. Stone,"Parallel Processing with Perfect Shuffle," IEEE Trans. Computers, vol. 20, no. 2, Feb. 1971.
[16] A. Youssef and B. Narahari, "Banyan-Hypercube Networks," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 160-169, Apr. 1990.