
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K. Day, A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 3138, January, 1994.  
BibTex  x  
@article{ 10.1109/71.262586, author = {K. Day and A. Tripathi}, title = {A Comparative Study of Topological Properties of Hypercubes and Star Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {1}, issn = {10459219}, year = {1994}, pages = {3138}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.262586}, 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  A Comparative Study of Topological Properties of Hypercubes and Star Graphs IS  1 SN  10459219 SP31 EP38 EPD  3138 A1  K. Day, A1  A. Tripathi, PY  1994 KW  Index Termshypercube networks; graph theory; multiprocessor interconnection networks; networktopology; hypercubes; star graphs; interconnection network topologies; comparativestudy; graph theory; parallel paths; spanning trees; greedy; asymptotically balanced;balanced spanning trees VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Undertakes a comparative study of two important interconnection network topologies:the star graph and the hypercube, from the graph theory point of view. Topologicalproperties are derived for the star graph and are compared with the correspondingproperties of the hypercube. Among other results, the authors determine necessary andsufficient conditions for shortest path routing and characterize maximumsized families of parallel paths between any two nodes of the star graph. These parallel paths are provenof minimum length within a small additive constant. They also define greedy andasymptotically balanced spanning trees to support broadcasting and personalizedcommunication on the star graph. These results confirm the already claimed topologicalsuperiority of the star graph over the hypercube.
[1] S. B. Akers, D. Horel and B. Krisnamurthy, "The Star graph: An attractive alternative to thencube," inProc. Int. Conf. Parallel Processing, pp. 393400, 1987.
[2] S. B. Akers and B. Krisnamurthy, "The fault tolerance of star graphs,"2nd Int. Conf. on Supercomputing, 1987.
[3] S. B. Akers and B. Krisnamurthy, "A grouptheoretic model for symmetric interconnection networks," inProc. Int. Conf. Parallel Processing, 1986, pp. 216223.
[4] S. N. Bhatt F. R. K. Chung, F. T. Leighton and A. L. Rosenberg, "Optimal simulations of tree machines," inProc. 27th IEEE Symp. Foundations Comput. Sci., 1986, pp. 274282.
[5] S. N. Bhatt and I. I. F. Ipsen, "How to embed trees in hypercubes," Tech. Rep. YALEU/CSD/RR443, Dep. Comput. Sci., California Inst. Technol., Jan. 1980.
[6] J. A. Bondy and U. S. R. Murthy,Graph Theory with Applications. Amstersdam: North Holland, 1979.
[7] S. A. Browning, "The tree machine: A highly concurrent computing environment," Ph.D. dissertation, California Instit. of Technol., 1980.
[8] K. Day and A. Tripathi, "A comparative study of topological properties of hypercubes and star graphs," Tech. Rep. TR 9110 Comput. Sci. Dept. Univ. of Minnesota, May 1991.
[9] S. R. Deshpande and R. M. Jenevin, "Scaleability of a binary tree on a hypercube," inProc. Int. Conf. Parallel Processing, 1986, pp. 661668.
[10] J. L. Gustafson, S. Hawkinson, and K. Scott, "The architecture of a homogeneous vector supercomputer," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 649652.
[11] J. P. Hayes, T. N. Mudge, Q. F. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer,"Proc. 1986 Int. Conf. Parallel Processing, 1986, pp. 653660.
[12] D. Hillis,The Connection Machine. Cambridge, MA: M.I.T. Press, 1985.
[13] S. L. Johnson and C. T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, no. 9, pp. 12491268, Sept. 1989.
[14] S. L. Johnsson, "Communication efficient basic linear algebra computations on hypercube architectures,"J. Parallel Distributed Comput., pp. 133172, 1987.
[15] J. S. Jwo, S. Lakshmivarahan, and S. K. Dhall, "Characterization of node disjoint (parallel) paths in star graphs," in5th Int. Parallel Processing Symp., 1991, pp. 404409.
[16] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: AddisonWesley, 1973.
[17] S. V. R. Madabhushi, S. Lakshmivarahan, and S. K. Dhall, "A note on orthogonal graphs," in5th Int. Parallel Processing Symp., 1991, pp. 432437.
[18] A. Menn and A. K. Somani, "An efficient sorting algorithm for the star graph interconnection network,"Proc. Int. Conf. Parallel Processing, vol. III, 1990, pp. 18.
[19] N. B. Nripendra and S. Srinivas, "A reconfigurable tree architecture with multistage interconnection network,"IEEE Trans. Comput., vol. 39, no. 12, pp. 14811485, Dec. 1990.
[20] J. J. Rotman,The Theory of Groups: An Introduction. Boston, MA: Allyn and Bacon, 1965.
[21] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867872, July 1988.
[22] I. D. Scherson, "Orthogonal graphs and the analysis and construction of a class of multistage interconnection networks," inProc. Int. Conf. Parallel Processing, vol. I, 1990, pp. 380387.
[23] A. Y. Wu, "Embedding of tree networks in hypercubes,"J. Parallel Dist. Comput., vol. 2, pp. 238249, 1985.