On the maximal connected component of hypercube with faulty vertices (II)

Authors

Yang, X., Evans, D.J. and Megson, G.M.

Abstract

In evaluating the fault tolerance of an interconnection network, it is essential to estimate the size of a maximal connected component of the network at the presence of faulty processors. Hypercube is one of the most popular interconnection networks. In this paper, we prove that for n ≥ 6, an n-dimensional cube with a set F of at most (4n - 10) failing processors has a component of size ≥2'' - |F| - 3. This result demonstrates the superiority of hypercube in terms of the fault tolerance.

Automatic derivation of systolic algorithms for Kalman filteringMegson, G.M. and Comish, D. 1994. Automatic derivation of systolic algorithms for Kalman filtering. in: McWhirter, J.G. (ed.) Mathematics in signal processing III: based on the proceedings of the third conference organized by the Institute of Mathematics and Its Applications on mathematics in signal processing, held at the University of Warwick in December 1992 Clarendon Press.

A systolic topelitz linear solverEvans, D.J. and Megson, G.M. 1990. A systolic topelitz linear solver. in: McWhirter, J.G. (ed.) Mathematics in signal processing II: based on the proceedings of a conference organized by the Institute of Mathematics and its Applications on mathematics in signal processing held at the University of Warwick in December 1988 Clarendon Press.