Show simple item record

dc.contributor.authorFriedman, Royen_US
dc.contributor.authorBirman, Kenen_US
dc.date.accessioned2007-04-23T18:06:29Z
dc.date.available2007-04-23T18:06:29Z
dc.date.issued1996-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1579en_US
dc.identifier.urihttps://hdl.handle.net/1813/7235
dc.description.abstractThis 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.extent198636 bytes
dc.format.extent168999 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleTrading Consistency for Availability in Distributed Systemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics