### Abstract

In this paper we study the ability of array-based networks to tolerate faults. We show that an N x N two- dimensional array can sustain N1-ϵ worst-case faults, for any fixed e > 0, and still emulate a fully functioning N x 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°W 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 | Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993 |

Publisher | Association for Computing Machinery |

Pages | 561-572 |

Number of pages | 12 |

ISBN (Electronic) | 0897915917 |

DOIs | |

State | Published - Jun 1 1993 |

Event | 25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States Duration: May 16 1993 → May 18 1993 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

Volume | Part F129585 |

ISSN (Print) | 0737-8017 |

### Conference

Conference | 25th Annual ACM Symposium on Theory of Computing, STOC 1993 |
---|---|

Country | United States |

City | San Diego |

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

### ASJC Scopus subject areas

- Software

### Cite this

*Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993*(pp. 561-572). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585). Association for Computing Machinery. https://doi.org/10.1145/167088.167235