Trading Consistency for Availability in Distributed Systems
eCommons (Cornell University)Published 8 April 1996Open access
Roy Friedman, Ken Birman
Citations17
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that two important classes of actions, non left commuting and strongly non commuting, cannot be executed by concurrent partitions in a system that provides serializable services.
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.
Keywords
Computer Science