Fast Computation Using Faulty Hypercubes

@inproceedings{HstadFastCU,
  title={Fast Computation Using Faulty Hypercubes},
  author={Johan H{\aa}stad and Tom Leighton and Mark Newman}
}
We consider the computational power of a hypercube containing a potentially large number of randomly located faulty components. Wedescribe a randomized algorithm which embeds an N-node hypercube in an N-node hypercube with faulty processors. Provided that the processors of the N-node hypercube are faulty with probability p < 1, and that the faults are independently distributed, we show that with high probability, the faulty hypercube can emulate the fault-free hypercube with only constant… CONTINUE READING