Asymptotically tight bounds for computing with faulty arrays of processors
Lists
Only you see this
Abstract
The computational power of 2-D and 3-D processor arrays that contain a potentially large number of faults is analyzed. Both a random and a worst-case fault model are considered, and it is proved that in either scenario low-dimensional arrays are surprisingly fault tolerant. It is also shown how to route, sort, and perform systolic algorithms for problems such as matrix multiplication in optimal time on faulty arrays. In many cases, the running time is the same as if there were no faults in the array (up to constant factors). On the negative side, it is shown that any constant congestion embedding of an n*n fault-free array on an n*n array with Theta (n/sup 2/) random faults (or Theta (log n) worst-case faults) requires dilation Theta (log n). For 3-D arrays, knot theory is used to prove that the required dilation is Omega ( square root log n).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
BibTeX
@inproceedings{kaklamanis1990asymptotically,
author = {Christos Kaklamanis and Anna R. Karlin and Frank Thomson Leighton and Victor Milenkovic and Prabhakar Raghavan and Satish Rao and Clark Thomborson and A. Tsantilas},
title = {{Asymptotically tight bounds for computing with faulty arrays of processors}},
booktitle = {FOCS},
year = {1990},
doi = {10.1109/fscs.1990.89547},
}Loading related content...