### Abstract

We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail during the computation, and may possibly bc restored later. We first introduce the notions of dejinite and tentatitie algorithms for executing a single parallel step of an ideal parallel machine on the unreliable machine. A definite algorithm is one that guarantees a correct execution of a step, while a tentative algorithm is one that is "highly likely" to produce a correct execution of a step on the unreliable machine. We show that any definite execution of one step requires Cl(log n) time on an∗processor unreliable machine, even if all the processors functioned perfectly, This implies an l(log n) slowdown for executing any non-Trivial program on the unreliable machine, provided only definite executions are used. We get around this overhead by combining tentative and definite execution schemes appropriately, to derive correct and efllcient robust executions for arbitrary PRAM programs, with expected amortized slowdown of only 0(1) for a variety of reasonable failure models. We adeve this by using a tentative algorithm to execute each of the program's steps, while using a definite algorithm to audit the execution at selected points. If the audit does not certify the execution as correct, then the execution is rolled back to a previous audit point and restarted from there. In contrast to this work, all previous results required a slowdown of Cl(log n), since they used definite algorithms only.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991 |

Publisher | Association for Computing Machinery |

Pages | 381-390 |

Number of pages | 10 |

Volume | Part F130073 |

ISBN (Electronic) | 0897913973 |

State | Published - Jan 3 1991 |

Event | 23rd Annual ACM Symposium on Theory of Computing, STOC 1991 - New Orleans, United States Duration: May 5 1991 → May 8 1991 |

### Other

Other | 23rd Annual ACM Symposium on Theory of Computing, STOC 1991 |
---|---|

Country | United States |

City | New Orleans |

Period | 5/5/91 → 5/8/91 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991*(Vol. Part F130073, pp. 381-390). Association for Computing Machinery.

**Combining tentative and definite executions for very fast i)ependable parallel computing.** / Kedem, Zvi; Palem, K. V.; Raghunathan, A.; Spirakis, P. G.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991.*vol. Part F130073, Association for Computing Machinery, pp. 381-390, 23rd Annual ACM Symposium on Theory of Computing, STOC 1991, New Orleans, United States, 5/5/91.

}

TY - GEN

T1 - Combining tentative and definite executions for very fast i)ependable parallel computing

AU - Kedem, Zvi

AU - Palem, K. V.

AU - Raghunathan, A.

AU - Spirakis, P. G.

PY - 1991/1/3

Y1 - 1991/1/3

N2 - We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail during the computation, and may possibly bc restored later. We first introduce the notions of dejinite and tentatitie algorithms for executing a single parallel step of an ideal parallel machine on the unreliable machine. A definite algorithm is one that guarantees a correct execution of a step, while a tentative algorithm is one that is "highly likely" to produce a correct execution of a step on the unreliable machine. We show that any definite execution of one step requires Cl(log n) time on an∗processor unreliable machine, even if all the processors functioned perfectly, This implies an l(log n) slowdown for executing any non-Trivial program on the unreliable machine, provided only definite executions are used. We get around this overhead by combining tentative and definite execution schemes appropriately, to derive correct and efllcient robust executions for arbitrary PRAM programs, with expected amortized slowdown of only 0(1) for a variety of reasonable failure models. We adeve this by using a tentative algorithm to execute each of the program's steps, while using a definite algorithm to audit the execution at selected points. If the audit does not certify the execution as correct, then the execution is rolled back to a previous audit point and restarted from there. In contrast to this work, all previous results required a slowdown of Cl(log n), since they used definite algorithms only.

AB - We present a general and efficient strategy for computing mtustly on unreliable parallel machines. The model of a parallel machine that we use is a CRCW PRAM with dynamic resource fluctuations: processors can fail during the computation, and may possibly bc restored later. We first introduce the notions of dejinite and tentatitie algorithms for executing a single parallel step of an ideal parallel machine on the unreliable machine. A definite algorithm is one that guarantees a correct execution of a step, while a tentative algorithm is one that is "highly likely" to produce a correct execution of a step on the unreliable machine. We show that any definite execution of one step requires Cl(log n) time on an∗processor unreliable machine, even if all the processors functioned perfectly, This implies an l(log n) slowdown for executing any non-Trivial program on the unreliable machine, provided only definite executions are used. We get around this overhead by combining tentative and definite execution schemes appropriately, to derive correct and efllcient robust executions for arbitrary PRAM programs, with expected amortized slowdown of only 0(1) for a variety of reasonable failure models. We adeve this by using a tentative algorithm to execute each of the program's steps, while using a definite algorithm to audit the execution at selected points. If the audit does not certify the execution as correct, then the execution is rolled back to a previous audit point and restarted from there. In contrast to this work, all previous results required a slowdown of Cl(log n), since they used definite algorithms only.

UR - http://www.scopus.com/inward/record.url?scp=84990703309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990703309&partnerID=8YFLogxK

M3 - Conference contribution

VL - Part F130073

SP - 381

EP - 390

BT - Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991

PB - Association for Computing Machinery

ER -