Percolation Theory and Computing with Faulty Arrays of Processors

@inproceedings{Mathies1992PercolationTA,
  title={Percolation Theory and Computing with Faulty Arrays of Processors},
  author={Thomas R. Mathies},
  booktitle={SODA},
  year={1992}
}
Let <italic>H</italic> be an <italic>n</italic> x <italic>n</italic> mesh-connected array of processors. Each processor is assumed to fail (independently) with probability <italic>p</italic>. Raghavan [5] gave an algorithm that with high probability routes packets in this mesh with <italic>O</italic>(log <italic>n</italic>) dilation and <italic>O</italic>(log<supscrpt>2</supscrpt><italic>n</italic>) load so long as <italic>p</italic> ≤ 0.29. KKLMRRTT [3] improve the load to <italic>O</italic>(1… CONTINUE READING

Similar Papers

Loading similar papers…