JavaScript is disabled for your browser. Some features of this site may not work without it.
Determining the Last Process to Fail
dc.contributor.author | Skeen, Dale | en_US |
dc.date.accessioned | 2007-04-23T16:44:07Z | |
dc.date.available | 2007-04-23T16:44:07Z | |
dc.date.issued | 1982-02 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-496 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6336 | |
dc.description.abstract | A total failure occurs whenever all processes cooperatively executing a distributed task fail before the task's completion. A frequent prerequisite for recovery from a total failure is the identification of the last group (LAST) of processes concurrently failing. Herein, we derive necessary and sufficient conditions for computing LAST from the local failure data of recovered processes. These conditions are easily translated into decision procedures for LAST membership using either complete or incomplete failure data. The choice of failure data itself is dictated by two requirements: (1) it can be cheaply maintained, and (2) maximum fault-tolerance is afforded in the sense that the expected number of recoveries required for identifying LAST is minimized. | en_US |
dc.format.extent | 1420021 bytes | |
dc.format.extent | 313611 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Determining the Last Process to Fail | en_US |
dc.type | technical report | en_US |