Fault tolerant networks with small degree (2000) [9 citations — 0 self]
|
Abstract:
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper), a graph G # is called a k-fault-tolerant graph of G if when we remove any k nodes from G # , it still contains a subgraph isomorphic to G. The major quality measures for a fault-tolerant graph are the number of spare nodes it uses and the maximum degree it has. The degree is particularly important in practice as it poses constraints on the scalability of the system. In this paper, we aim at designing fault-tolerant graphs with both small degree and small number of spare nodes. The graphs we obtain have degree O(1) for arrays and O(log 3 k) for meshes. The number of spare nodes used are O(k log 2
Citations
| 1206 | Introduction to Parallel Algorithms and Architectures: Arrays – Leighton - 1992 |
| 75 | Explicit construction of linear sized tolerant networks – Alon, Chung - 1986 |
| 47 | On the fault tolerance of some popular bounded-degree networks – Leighton, Maggs, et al. - 1992 |
| 46 | A new representation for linear lists – Guibas, McCreight, et al. - 1977 |
| 32 | Asymptotically tight bounds for computing with faulty arrays of processors – Kaklamanis, Karlin, et al. - 1990 |
| 22 | Fault Tolerant Data Structures – Aumann, Bender - 1996 |
| 17 | Fault-tolerant meshes with small degree – Bruck, Cypher, et al. - 1993 |
| 16 | The diogenes approach to testable fault-tolerant arrays of processors – Rosenberg - 1983 |
| 5 | Fault tolerant graphs, perfect hash functions and disjoint paths – Ajtai, Alon, et al. - 1992 |
| 1 | Fast computation using faulty hypercubes (extended abstract – Hastad, Leighton, et al. - 1989 |
| 1 | Fault-tolerant interconnection networks: a graph-theoretic approach – Rosenberg - 1983 |
