Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)

@inproceedings{Kaklamanis1990AsymptoticallyTB,
  title={Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)},
  author={Christos Kaklamanis and Anna R. Karlin and Frank Thomson Leighton and Victor J. Milenkovic and Prabhakar Raghavan and Satish Rao and Clark D. Thomborson and A. Tsantilas},
  booktitle={FOCS},
  year={1990}
}
In the paper, we analyze the computational power of 2 and 3-dimensional processor arrays that contain a potentially large number of faults. We consider both a random a and worst-case fault model, and we prove that in either scenario, low-dimensional arrays are surprisingly fault-tolerant. For example, we show how to emulate an n e x n m fault-free array on an n x n array containing Q(n2) random faults with sIowdown O(logn), the same slowdown that is used by a fault-free n x n array to perform… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

A Surveyfor Algorithms for Integrating Wafer-Scale Systolic Arrays, In Wafer Scale Integration, (G

F. T. Leighton, C. E. Leiserson
Saucier, J. Trilhe eds.), pp. 177-195, • 1986

Sorting networks and their applications

A. El Gamal
Proceedings of the AFIPS Spring Joint Computing Conference • 1977

Similar Papers

Loading similar papers…