Trading Consistency for Availability in Distributed Systems
| dc.contributor.author | Friedman, Roy | en_US |
| dc.contributor.author | Birman, Ken | en_US |
| dc.date.accessioned | 2007-04-23T18:06:29Z | |
| dc.date.available | 2007-04-23T18:06:29Z | |
| dc.date.issued | 1996-04 | en_US |
| dc.description.abstract | This paper shows that two important classes of actions, {\em non left commuting}\/ and {\em strongly non commuting}, cannot be executed by concurrent partitions in a system that provides serializable services. This result indicates that there is an inherent limitation to the ability of systems to provide services in a consistent manner during network partitions. | en_US |
| dc.format.extent | 198636 bytes | |
| dc.format.extent | 168999 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/TR96-1579 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7235 | |
| 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 | Trading Consistency for Availability in Distributed Systems | en_US |
| dc.type | technical report | en_US |