
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Ghafoor, T.R. Bashkow, "A Study of Odd Graphs as FaultTolerant Interconnection Networks," IEEE Transactions on Computers, vol. 40, no. 2, pp. 225232, February, 1991.  
BibTex  x  
@article{ 10.1109/12.73594, author = {A. Ghafoor and T.R. Bashkow}, title = {A Study of Odd Graphs as FaultTolerant Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {2}, issn = {00189340}, year = {1991}, pages = {225232}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.73594}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Study of Odd Graphs as FaultTolerant Interconnection Networks IS  2 SN  00189340 SP225 EP232 EPD  225232 A1  A. Ghafoor, A1  T.R. Bashkow, PY  1991 KW  odd graphs; faulttolerant interconnection networks; ring; star; mesh; binary ncube; chordal ring; fliptrees; selfrouting algorithms; maximal fault tolerance; resilience; persistence; partitioning property; Hadamard matrices; selfdiagnostics; fault tolerant computing; parallel architectures. VL  40 JA  IEEE Transactions on Computers ER   
Odd graphs are analyzed to determine their suitable in designing interconnection networks. These networks are shown to possess many features that make them competitive with other architectures, such as ring, star, mesh, the binary ncube and its generalized form, the chordal ring, and fliptrees. Among the features are small internode distances, a lighter density, simplicity in implementing various selfrouting algorithms (both for faulty and nonfaulty networks), capability of maximal fault tolerance, strong resilience, and good persistence. The routing algorithms (both for the faulty and faultfree networks) do not require any table lookup mechanism, and intermediate nodes do not need to modify the message. These graphs are shown to have a partitioning property that is based on Hadamard matrices and can be effectively used for a system's expansion and selfdiagnostics.
[1] D. K. Pradhan and S. M. Reddy, "A faulttolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C31, pp. 863870, Sept. 1982.
[2] L. N. Bhuyan and D. P. Agarwal, "Design and performance of a general class of interconnection networks,"IEEE Trans. Comput., vol. C30, pp. 587590, Aug. 1981.
[3] S. B. Akers and B. Krishnamurthy, "Faulttolerance in star graphs," inProc. 1987 Int. Conf. Supercomput., San Francisco, CA, May 1987.
[4] L. W. Hawkes, "A regular faulttolerant architecture for interconnection networks,"IEEE Trans. Comput., vol. C34, pp. 677680, July 1985.
[5] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[6] Q. F. Stout, "Mesh connected computers with broadcast,"IEEE Trans. Comput., vol. C30, pp. 291295, Apr. 1981.
[7] F. J. Meyer and D. K. Pradhan, "Fliptrees: Faulttolerant graphs with wide containers,"IEEE Trans. Comput., vol. C37, pp. 472478, Apr. 1988.
[8] A. Ghafoor, T. R. Bashkow, and I. Ghafoor, "Bisectional faulttolerant communication architecture for supercomputer systems,"IEEE Trans. Comput., vol. 38, pp. 14251446, Oct. 1989.
[9] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Comput., pp. 848854, Dec. 1967.
[10] J. G. Kuhl and S. M. Reddy, "Distributed faulttolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[11] N. Biggs, "Some odd graph theory,"Ann. NY Academy Sci., vol. 319, pp. 7181, 1979.
[12] S. B. Akers and B. Krishnamurthy, "Group graphs as interconnection networks," inProc. 14th Int. Symp. Faul.Tolerant Comput., Orlando, FL, June 1984, pp. 422427.
[13] C. D. Godsil, "More odd graph theory,"Discrete Math., vol. 32, pp. 205207, 1980.
[14] A. Ghafoor, "Some classes of faulttolerant communication architecture for distributed computing systems," Tech. Rep. TR854, Dep. Elec. Comput. Eng., Syracuse Univ., 1985.
[15] M. E. Watkins, "Connectivity in transitive graphs,"J. Combinatorial Theory, vol. 8, no. 1, pp. 2329, Jan. 1970.
[16] F. J. MacWilliams and N. J. A. Sloane,The Theory of ErrorCorrecting Codes, Vols. I and II. New York: NorthHolland, 1977.
[17] D. I. A. Cohen,Combinatorial Theory. New York: Wiley, 1978.