
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Latifi, N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 97102, January, 1994.  
BibTex  x  
@article{ 10.1109/71.262593, author = {S. Latifi and N. Bagherzadeh}, title = {Incomplete Star: An Incrementally Scalable Network Based on the Star Graph}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {1}, issn = {10459219}, year = {1994}, pages = {97102}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.262593}, 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  Incomplete Star: An Incrementally Scalable Network Based on the Star Graph IS  1 SN  10459219 SP97 EP102 EPD  97102 A1  S. Latifi, A1  N. Bagherzadeh, PY  1994 KW  Index Termsmultiprocessor interconnection networks; graph theory; network routing; interconnectionnetwork; massively parallel systems; star graph; incomplete star graph; incrementallyscalable network; interconnecting; labeling; pointtopoint communications; C/sup n/splminus/1/ graph; Hamiltonian; Cayley graph; routing VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Introduces a new interconnection network for massively parallel systems called theincomplete star graph. The authors describe unique ways of interconnecting and labelingthe nodes and routing pointtopoint communications within this network. In addition,they provide an analysis of a special class of incomplete star graph called C/sup n/splminus/1/ graph and obtain the diameter and average distance for this network. For theC/sup n/spl minus/1/ graph, an efficient broadcasting scheme is presented. Furthermore,it is proven that a C/sup n/spl minus/1/ with N nodes (i.e. N=m(n/spl minus/1)!) isHamiltonian if m=4 or m=3k, and k/spl ne/2.
[1] S. B. Akers, D. Horel, and B. Krishnamurthy, "The star graph: An attractive alternative to thencube," inProc. Int. Conf. Parallel Processing, pp. 393400, 1987.
[2] S. B. Akers and B. Krishnamurthy, "A grouptheoretic model for symmetric interconnection networks," inProc. Int. Conf. Parallel Processing, pp. 216223, 1986.
[3] S. B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs," inProc 2nd Int. Conf. Supercomputing, 1987.
[4] D. Marusic, "Hamiltonian circuits in Cayley graphs,"Discrete Math., pp. 4954, 1983.
[5] A. Menn and A. K. Somani, "An efficient sorting algorithm for the star graph interconnection network," inProc. Int. Conf. Parallel Processing, vol. III, pp. 18, 1990.
[6] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Networks," inProc. Int. Conf. Parallel Processing, pp. 340343, 1990.
[7] J. S. Jwo, S. Lakshmivarahan, and S. K. Dhall, "Embedding of cycles and grids in star graphs,"J. Circuits, Syst., Computers, vol. 1, No. 1, pp. 4374, 1991.
[8] H. Katseff, "Incomplete hypercubes,"IEEE Trans. Comput., vol. 37, pp. 604608, May 1988.
[9] S. G. Akl, K. Qiu, and I. Stojmenovic, "Data communication and computational geometry on the star and pancake interconnection networks," inProc. 3rd IEEE Symp. Parallel Distrib. Processing, 1991, pp. 415422.
[10] S. Sur and K. Srimani, "Super star: A new optimally fault tolerant network," Colorado State Univ., Tech. Rep. CS90107, 1990.