A Quorum-Based Commit Protocol
| dc.contributor.author | Skeen, Dale | en_US |
| dc.date.accessioned | 2007-04-23T16:43:19Z | |
| dc.date.available | 2007-04-23T16:43:19Z | |
| dc.date.issued | 1982-02 | en_US |
| dc.description.abstract | Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead. | en_US |
| dc.format.extent | 1177989 bytes | |
| dc.format.extent | 391246 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-483 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6323 | |
| 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 | A Quorum-Based Commit Protocol | en_US |
| dc.type | technical report | en_US |