Abstract
This paper proposes a new graph model for multibus multiprocessor system. based on the link representation of cut set of the hypergraph, ring sum and its algebraic properties, we can directly calculate the degrees of bus-fault-tolerance and processor-fault-tolerance for any multibus multiprocessor system. Algorithms are listed and all the theorems and proofs are stated.
Similar content being viewed by others
References
M. Ajmone Marsan and M. Gerla, Markov models for multiple bus multiprocessor systemsIEEE Trans. Computer, C-31 (1982), 239–248.
D. K. Pradhan, Z., Hanquan and M. L. Schlumberger, Fault-Tolerant Multibus Architectures for Multiprocessors, 14th International Symposium on Fault-Tolerant Computing, June, 20–22 1984, FTC—14 Kissimmee, 400–408.
J. A. Buzacott and S. K. Chang, Cut-set intersections and node partitions,IEEE Trans. Reliability, R-33: 5 (1984), 385–389.
Yinong Chen, Tinghuai Chen, DET: Distributed Fault-Toelrance Analysis and Design, 15th International Symposium on Fault-Tolerant Computing, FTC-15, 1986.
Jianzhong Zhang and Tinghuai Chen, RMISE and C t/nl : Two Fault-Toulrant Interconnection Networks, 14th International Symposium on Fault-Tolerant Computing, FTCS-14, 1984.
Zhenli Zhou and Tai Kang, Combinatorial Mathematics, Chongqing University Press, 1986 (in Chinese).
Claude Berge, Graphs and Hypergraphs, North-Holland, Publishing Company, 1973.
Tinghuai Chen, Tai Kang and Yong Yao, The connectivity of hypergraph and the design of fault-tolerant Multibus,Scientia Sinica, Series A, 5(1988), 597–610.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yao, R., Chen, T. & Kang, T. Fault-tolerance analysis of multibus multiprocessor system. J. of Comput. Sci. & Technol. 4, 172–177 (1989). https://doi.org/10.1007/BF02943365
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943365