SIMULATION STUDIES OF RECONFIGURATION STRATEGY FOR K-FT MULTIPROCESSOR NETWORK

Abstract

The rapid development of Very Large Scale Integrated (VLSI) technology and the need of very reliable multiprocessor network has opened up new frontiers of research in the field of fault-tolerant multiprocessor network. A multiprocessor network is represented by a graph whose nodes are the processors and the edges are interprocessor communication links. Simulation studies of reconfiguration strategy for k-Fault-tolterent multiprocessor nonhomogeneous symmetric d-ary tree (NST) network has been done in this dissertation. A supergraph S[k,T] of a tree T is a k-FT realization of T, if S[k,T] contains a subgraph Isomorphic to T, after removal of any k nodes. It was _.carried out- in two parts. Part-I- deals with the. design and reconfiguration strategy for k<d and the Part-II deals with the design and reconfiguration strategy fof kid.