
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. ElAmawy, S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 1, pp. 3142, January, 1991.  
BibTex  x  
@article{ 10.1109/71.80187, author = {A. ElAmawy and S. Latifi}, title = {Properties and Performance of Folded Hypercubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {2}, number = {1}, issn = {10459219}, year = {1991}, pages = {3142}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.80187}, 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  Properties and Performance of Folded Hypercubes IS  1 SN  10459219 SP31 EP42 EPD  3142 A1  A. ElAmawy, A1  S. Latifi, PY  1991 KW  Index Termsperformance; folded hypercubes; hypercubetype structure; optimal routing algorithms;onetoone communication; broadcasting; communication parameters; average distance;message traffic density; communication time delay; fault tolerance capabilities; faulttolerant computing; hypercube networks; performance evaluation VL  2 JA  IEEE Transactions on Parallel and Distributed Systems ER   
A new hypercubetype structure, the folded hypercube (FHC), which is basically astandard hypercube with some extra links established between its nodes, is proposed andanalyzed. The hardware overhead is almost 1/n, n being the dimensionality of thehypercube, which is negligible for large n. For this new design, optimal routing algorithms are developed and proven to be remarkably more efficient than those of the conventional ncube. For onetoone communication, each node can reach any other node in the network in at most (n/2) hops (each hop corresponds to the traversal of a single link), as opposed to n hops in the standard hypercube. Onetoall communication (broadcasting) can also be performed in only (n/2) steps, yielding a 50% improvement in broadcasting time over that of the standard hypercube. All routing algorithms are simple and easy to implement. Correctness proofs for the algorithms are given. For the proposedarchitecture, communication parameters such as average distance, message trafficdensity, and communication time delay are derived. In addition, some fault tolerancecapabilities of this architecture are quantified and compared to those of the standardcube. It is shown that this structure offers substantial improvement over existinghypercubetype networks in terms of the abovementioned network parameters.
[1] S. R. Deshpande and R. M. Jenevein, "Scalability of a binary tree on a hypercube," inProc. Int. Conf. Parallel Processing, 1986, pp. 661668.
[2] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, no. 7, pp. 867872, July 1988.
[3] H. J. Siegel,Interconnection Networks for LargeScale Parallel Processing: Theory and Case Studies. Lexington, MA: Lexington Books, 1985.
[4] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[5] J. Rattner, "Concurrent processing: A new direction in scientific computing," inAFIPS Conf. Proc., vol. 54, pp. 157166, 1985.
[6] J. J. Dongarra and I. S. Dutt, "Advanced architecture computers," Tech. Memo. 57, Argonne National Lab., 1985.
[7] J. P. Hayeset al., "A microprocessorbased hypercube supercomputer,"IEEE Micro, vol. 6, pp. 617, Oct. 1986.
[8] J. C. Peterson, J. O. Tuazon, D. Lieberman, and M. Paniel, "The Mark III hypercube ensemble concurrent processor," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 7173.
[9] W. D. Hills,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[10] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C33, no. 4, pp. 323333, Apr. 1984.
[11] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[12] Y. Lan, A. Esfahanian, and L. M. Ni, "Multicast in hypercube multiprocessors," inProc. 3rd Int. Conf. Supercomput., May 1988.
[13] J. Bondy and U. Murthy,Graph Theory with Applications.New York: American Elsevier, 1976.
[14] G. C. Fox, S. W. Otto, and A. J. G. Hey, "Matrix algorithms on a hypercube I: Matrix multiplication," Tech. Rep. Hm 206, Caltech, Oct. 1985.
[15] S. L. Johnsson, "Communication efficient basic linear algebra computing on hypercube architectures," Tech. Rep. YALEU/CSD/rr 361, Dep. Comput. Sci., Yale Univ., Jan. 1985.
[16] O.A. Mcbryan and E.F. Van de Velde, "Hypercube algorithms and implementations," inProc. 2nd SIAM Conf. Parallel Comput., Nov. 1985.
[17] Y. Saad and M. H. Schultz, "Data communication in hypercubes," Tech. Rep. YALEU/DCS/RR428, Dep. Comput. Sci., Yale Univ., Oct. 1985.
[18] C.T. Ho and S.L. Johnsson, "Distributed routing algorithms for broadcasting and personalized communication in hypercubes," inProc. Int. Conf. Parallel Processing, Aug. 1986, pp. 640648.
[19] L. Kleinrock,Queueing Systems: Vol. II, Computer Applications.New York: Wiley, 1976.
[20] C. J. Colbourn,The Combinatorics of Network Reliability. Oxford, U.K.: Oxford University Press, 1987.
[21] F. J. Meyer and D. K. Pradhan, "Fliptrees: Fault tolerant graphs with wide containers,"IEEE Trans. Comput., vol. 37, no. 4, pp. 472478, Apr. 1988.
[22] NCUBE Corp.,NCUBE Handbook, version 1.0, Beaverton, OR, Apr. 1986.