Asymptotically tight bounds for computing with faulty arrays of processors

C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, A. Tsantilas

Research output: Contribution to journalConference articlepeer-review

45 Scopus citations


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 Θ(n2) random faults (or Θ(log n) worst-case faults) requires dilation Θ(log n). For 3-D arrays, knot theory is used to prove that the required dilation is Ω(√log n).

Original languageEnglish (US)
Pages (from-to)285-296
Number of pages12
JournalIEEE Transactions on Industry Applications
Issue number1 pt 1
StatePublished - Jan 1 1991
Externally publishedYes
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: Oct 1 1989Oct 5 1989

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering


Dive into the research topics of 'Asymptotically tight bounds for computing with faulty arrays of processors'. Together they form a unique fingerprint.

Cite this