Mapping of fault-tolerant permutations in omega interconnection network
This paper presents a comprehensive treatment of the fault-tolerant characteristics of Omega interconnection network, which is a typical member of a class of non-redundant multistage interconnection networks characterised by the full-access property and unique-path property, in the presence of single faulty switching element in the network. A significant amount of research works has already been made in making a multistage interconnection network fault-tolerant by introducing redundancy in the network, which in its turn, increases the cost and complexity of the system. The extent to which an Omega network can be considered to be fault-tolerant in the presence of single faulty switching element and without the introduction of any redundancy, has been explored in this paper. Several claims, together with the corresponding proofs, have been made in this respect. In view of the unique-path property of this non-redundant network, every permutation is definitely not attainable in the presence of faults in the network; but, even a set of some fault-tolerant permutations, as discussed in this paper, may be of immense help in a distributed computing environment, which is characterised by the absence of any preference amongst all the possible permutations.
Unable to display preview. Download preview PDF.
- 1.A. Verma and C.S. Raghavendra, "Fault-tolerant routing in multistage interconnection networks," IEEE Trans. Comput., vol 38 no. 3, pp. 385–393, Mar. 1989.Google Scholar
- 2.I. Gazit and M. Malek, "Fault tolerance capabilities in multistage network-based multicomputer systems," IEEE Trans. Comput., vol 37 no. 7, pp. 788–798, Jul. 1988.Google Scholar
- 3.G.B. Adams and H.J. Siegel, "The extra-stage cube: a fault-tolerant interconnection network for supersystems," IEEE Trans. Comput., vol c-31 no. 5, pp. 443–454, May 1982.Google Scholar
- 4.T. Feng and C. Wu, "Fault-diagnosis for a class of multistage interconnection networks," IEEE TRans. Comput., vol c-30 no. 10, pp. 743–758, Oct. 1981.Google Scholar
- 5.D.P. Agarawal, "Testing and fault-tolerance of multistage interconnection networks," IEEE Computer, vol 15, pp. 41–53, Apr. 1982.Google Scholar
- 6.T. Feng, "A survey of interconnection networks," IEEE Computer, vol 14, pp. 12–27, Dec. 1981.Google Scholar
- 7.C. Wu and T. Feng, "Fault diagnosis for a class of multistage shiffle/exchange networks," IEEE Trans. Comput., vol c-30, pp. 743–758, Oct. 1981.Google Scholar
- 8.J.P. Shen and J.P. Hayes, "Fault-tolerance of dynamic full-access interconnection networks," IEEE Trans. Comput., vol c-33 no. 3, pp. 241–248, Mar. 1984.Google Scholar
- 9.L. Bhuyan and D.P. Agarwal, "Design and performance of a general class of interconnection networks," Proc. 1982 Int. Conf. Parallel Process., Bellaire, Mi, pp. 2–9, Aug. 1982.Google Scholar
- 10.C. Wu and T. Feng, "On a class of multistage interconnection networks," IEEE Trans. Comput., vol c-29, pp. 694–702, Aug. 1980.Google Scholar
- 11.D.P. Agarwal and J.S. Leu, "Dynamic accessibility testing and path length optimization of multistage interconnection networks," Proc. 4th Int. Conf. Distributed Comput. Syst., pp. 266–277, May 1984.Google Scholar
- 12.D.P. Agarwal, "Graph theoretical analysis and design of multistage interconnection networks," IEEE Trans. Comput., vol c-32 no. 7, pp. 637–648, Jul. 1983.Google Scholar