Performance of regular and irregular dynamic MINs

Abstract

The fault-tolerant behavior of an irregular network, quad tree, has been analyzed and compared with a regular network, the augmented baseline network, under fault-free conditions and in the presence of faults. Identity permutation allows most memory references to be made without conflict where the topology of the network plays a decisive role. Both the MINs pass all the permutations, but under fault-free conditions, in irregular networks, 50% of the requests passed have minimum path length of just 2 irrespective of the size of the network, which is not the case of regular networks. Under similar conditions, the path length available is more than 2. This paper also analyses and compares the reliability of these MINs which again shows that the reliability of irregular MINs is better than that of regular MINs.