This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Fault-Tolerant Extension Problem for Complete Multipartite Networks
February 1994 (vol. 5 no. 2)
pp. 205-210

We develop a characterization for m-fault-tolerant extensions, and for optimalm-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows thatthis problem is equivalent to an interesting combinatorial problem on the partitioning ofintegers. This characterization leads to a new procedure for constructing an optimalm-fault-tolerant extension of any complete multipartite graph, for any m/spl ges/0. Theproposed procedure is mainly useful when the size of the graph is relatively small,because the search time required is exponential. This exponential search, however, is notalways necessary. We prove several necessary conditions that help us, in several cases,to identify some optimal m-fault-tolerant extensions without performing any search.

[1] T. Anderson and P. Lee,Fault Tolerance: Principles and Practice. London, UK: Prentice-Hall International, 1981.
[2] S. Dutt and J. P. Hayes, "Design and reconfiguration strategies for near-optimal fault-tolerant tree architectures," inProc. Eighteenth Fault Tolerant Comput. Symp., June 1988, pp. 328-333.
[3] S. Dutt and J. P. Hayes, "Designing fault-tolerant systems using automorphisms,"J. Parallel Distributed Comput., pp. 249-268, July 1991.
[4] R. J. Dawson and A. A. Farrag, "Fault-tolerant extensions of star networks,"in Networks, vol. 21, pp. 373-385, 1991.
[5] A.A. Farrag and R. J. Dawson, "Designing optimal fault-tolerant star networks,"in Networks, vol. 19, pp. 707-716, Oct. 1989.
[6] A. Hassan and V. Agrawal, "A modular approach to fault-tolerant modular tree architecture,"Proc. 15th Fault Tolerant Comput. Symp., 1985, pp. 344-349.
[7] J. Hayes, "A graph model for fault-tolerant computing systems,"IEEE Trans. Comput., vol. C-25, no. 9, pp. 875-884, Sept. 1976.
[8] L. Hua,Introduction to Number Theory. New York: Springer-Verlag, 1982.
[9] R. Keller, G. Lindstorm, and S. Patil, "A loosely coupled applicative multiprocessing system,"in AFIPS Proc. National Comput. Conf., 1979, pp. 613-622.
[10] C. Kwan and S. Toida, "An optimal 2-ft realization of binary symmetric tree systems,"in Networks, vol. 12, pp. 231-239, 1982.
[11] M. B. Lowrie and W. K. Fuchs, "Reconfigurable tree architectures using subtree oriented fault tolerance,"IEEE Trans. Comput., vol. C-36, pp. 1172-1182, Oct. 1987.
[12] G.J. Myers,Advances in Computer Architecture, 2nd Ed., John Wiley&Sons, 1982, 545 pp.
[13] C. Raghavendra, A. Avizienis, and M. Ercegovac, "Fault-tolerant in binary tree architectures,"IEEE Trans. Comput., vol. C-33, no. 6, pp. 568-572, June 1984.
[14] E. Schmitter and P. Baues, "The basic fault-tolerant system,"IEEE Micro, vol. 4, no. 1, pp. 66-74, Feb. 1984.
[15] J. Wolfet al., "Design of a distributed fault-tolerant loop network,"in Proc. 9th Int. Symp. on Fault-Tolerant Computing, 1979, pp. 17-24.

Index Terms:
Index Termsfault tolerant computing; fault-tolerant extension problem; complete multipartite networks; combinatorial problem; search time
Citation:
A. Aziz Farrag, R.J. Dawson, "The Fault-Tolerant Extension Problem for Complete Multipartite Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 2, pp. 205-210, Feb. 1994, doi:10.1109/71.265947
Usage of this product signifies your acceptance of the Terms of Use.