This Article 
 Bibliographic References 
 Add to: 
Connective Fault Tolerance in Multiple-Bus Systems
June 1997 (vol. 8 no. 6)
pp. 574-586

Abstract—We present an efficient approach to characterizing the fault tolerance of multiprocessor systems that employ multiple shared buses for interprocessor communication. Of concern is connective fault tolerance, which is defined as the ability to maintain communication between any two fault-free processors in the presence of faulty processors, buses, or processor-bus links. We introduce a model called processor-bus-link (PBL) graphs to represent a multiple-bus system's interconnection structure. The model is more general than previously proposed models, and has the advantages of simple representation, broad application, and the ability to model partial bus failures. The PBL graph implies a set of component adjacency graphs that highlights various connectivity features of the system. Using these graphs, we propose a method for analyzing the maximum number of faults a multiple-bus system can tolerate, and for identifying every minimum set of faulty components that disconnects the processors of the system. We also analyze the connective fault tolerance of several proposed multiple-bus systems to illustrate the application of our method.

[1] B.E. Aupperle and J.F. Meyer, “Fault-Tolerant BIBD Networks,” Proc. Int'l Symp. Fault-Tolerant Computing, (FTCS 18), pp. 306-311, 1988.
[2] C. Berge, Graphs and Hypergraphs.Amsterdam: North-Holland, 1976.
[3] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, pp. 323-333, 1984.
[4] D. Bulka and J.B. Dugan, “Design and Analysis of Multibus System Using Projective Geometry,” Proc. Int'l Symp. Fault-Tolerant Computing (FTCS 22), pp. 122-129, 1992.
[5] B. Cantanzaro,"Multiprocessor System Architectures," Prentice-Hall, Englewood Cliffs, N.J., 1994.
[6] T. Chen and T. Kang, "The Connectivity of Hypergraph and the Design of Fault-Tolerant Multibus Systems," Proc. 18th Symp. Fault-Tolerant Computing, pp. 374-379, 1988.
[7] P.W. Dowd, "Wavelength Division Multiple Access Channel Hypercube Processor Interconnection," IEEE Trans. Computers, vol. 41, no. 10, pp. 1,223-1,241, Oct. 1992.
[8] S. Even,Graph Algorithms. Pitman Publishing, 1979.
[9] J.R. Goodman and P.J. Woest, “The Wisconsin Multicube: A New Large-Scale Cache-Coherent Multiprocessor,” Proc. 15th Ann. Int'l Symp. Computer Architecture, pp. 422-431, 1988.
[10] F. Harary, Graph Theory.Reading, Mass.: Addison-Wesley, 1969.
[11] R.M. Hord, Parallel Supercomputing in MIMD Architectures.Boca Raton, Fla.: CRC Press, 1993.
[12] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[13] S. Khuller and B. Schieber, "Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs," SIAM J. Computers, vol. 20, pp. 352-375, 1991.
[14] H.-K. Ku, "Fault-Tolerant Interconnection Networks for Multiprocessors," Technical Report CSE-TR-226-94, Univ. of Michigan, Ann Arbor, 1994.
[15] H.-K. Ku and J.P. Hayes, "Structural Fault Tolerance in VLSI-Based Systems," Proc. Fourth Great Lakes Symp. VLSI, pp. 50-55, 1994.
[16] T. Lang, M. Valero, and I. Alegre, "Bandwidth of Crossbar and Multiple-Bus Connections for Multiprocessors," IEEE Trans. Computers, vol. 31, pp. 1,227-1,234, 1982.
[17] M.A. Marsan, "Multichannel Local Area Networks," Proc. COMPCON Fall 82, pp. 493-502, 1982.
[18] K. Mehlhorn, Graph Algorithms and NP-Completeness.Berlin: Springer-Verlag, 1984.
[19] T.N. Mudge, D.C. Winsor, and J.P. Hayes, “Multiple Bus Architectures,” Computer, vol. 20, pp. 42-48, June 1987.
[20] D.K. Pradhan, "Fault-Tolerant Multiprocessor Link and Bus Network Architectures," IEEE Trans. Computers, vol. 34, pp. 33-45, 1985.
[21] D.K. Pradhan, Z. Hanquan, and M.L. Schlumberger, "Fault-Tolerant Multibus Architectures for Multiprocessors," Proc. 14th Symp. Fault-Tolerant Computing, pp. 400-408, 1984.
[22] D. Siewiorek and R. Swarz, Reliable Computer Systems: Design and Evaluation. Digital Press, 1992.
[23] A. Varma and S. Chalasani, "Fault-Tolerant Analysis of One-Sided Crosspoint Switching Networks," IEEE Trans. Computers, vol. 41, pp. 143-158, 1992.
[24] L.D. Wittie, "Communication Structures for Large Networks of Microcomputers," IEEE Trans. Computers, vol. 30, pp. 264-273, 1981.

Index Terms:
Multiple-bus systems, multiprocessors, fault tolerance, graph models, interconnection methods.
Hung-Kuei Ku, John P. Hayes, "Connective Fault Tolerance in Multiple-Bus Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 6, pp. 574-586, June 1997, doi:10.1109/71.595574
Usage of this product signifies your acceptance of the Terms of Use.