### Abstract

In this paper we study the ability of array-based networks to tolerate faults. We show that an N×N two-dimensional array can sustain N^{1-ε} worst-case faults, for any fixed ε>0, and still emulate a fully functioning N×N array with only constant slowdown. We also observe that even if every node fails with some fixed probability, p, with high probability the array can still emulate a fully functioning array with constant slowdown. Previously, no connected bounded-degree network was known to be able to tolerate constant-probability node failures without suffering more than a constant-factor loss in performance. Finally, we observe that if faulty nodes are allowed to communicate, but not compute, then an N-node one-dimensional array can tolerate log^{O(1)} N worst-case faults and still emulate a fault-free array with constant slowdown, and this bound is tight.

Original language | English (US) |
---|---|

Title of host publication | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

Publisher | Publ by ACM |

Pages | 561-572 |

Number of pages | 12 |

ISBN (Print) | 0897915917 |

State | Published - 1993 |

Event | Proceedings of the 25th Annual ACM Symposium on the Theory of Computing - San Diego, CA, USA Duration: May 16 1993 → May 18 1993 |

### Other

Other | Proceedings of the 25th Annual ACM Symposium on the Theory of Computing |
---|---|

City | San Diego, CA, USA |

Period | 5/16/93 → 5/18/93 |

### ASJC Scopus subject areas

- Software

### Cite this

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing*(pp. 561-572). Publ by ACM.

**Multi-scale self-simulation : A technique for reconfiguring arrays with faults.** / Cole, Richard; Maggs, Bruce; Sitaraman, Ramesh.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Conference Proceedings of the Annual ACM Symposium on Theory of Computing.*Publ by ACM, pp. 561-572, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, USA, 5/16/93.

}

TY - GEN

T1 - Multi-scale self-simulation

T2 - A technique for reconfiguring arrays with faults

AU - Cole, Richard

AU - Maggs, Bruce

AU - Sitaraman, Ramesh

PY - 1993

Y1 - 1993

N2 - In this paper we study the ability of array-based networks to tolerate faults. We show that an N×N two-dimensional array can sustain N1-ε worst-case faults, for any fixed ε>0, and still emulate a fully functioning N×N array with only constant slowdown. We also observe that even if every node fails with some fixed probability, p, with high probability the array can still emulate a fully functioning array with constant slowdown. Previously, no connected bounded-degree network was known to be able to tolerate constant-probability node failures without suffering more than a constant-factor loss in performance. Finally, we observe that if faulty nodes are allowed to communicate, but not compute, then an N-node one-dimensional array can tolerate logO(1) N worst-case faults and still emulate a fault-free array with constant slowdown, and this bound is tight.

AB - In this paper we study the ability of array-based networks to tolerate faults. We show that an N×N two-dimensional array can sustain N1-ε worst-case faults, for any fixed ε>0, and still emulate a fully functioning N×N array with only constant slowdown. We also observe that even if every node fails with some fixed probability, p, with high probability the array can still emulate a fully functioning array with constant slowdown. Previously, no connected bounded-degree network was known to be able to tolerate constant-probability node failures without suffering more than a constant-factor loss in performance. Finally, we observe that if faulty nodes are allowed to communicate, but not compute, then an N-node one-dimensional array can tolerate logO(1) N worst-case faults and still emulate a fault-free array with constant slowdown, and this bound is tight.

UR - http://www.scopus.com/inward/record.url?scp=0027188173&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027188173&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027188173

SN - 0897915917

SP - 561

EP - 572

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - Publ by ACM

ER -