Trading Consistency for Availability in Distributed Systems

   page       BibTeX_logo.png       attach   
Roy Friedman, Ken Birman
Computer Science Technical Reports TR96-1579
April 1996

This paper shows 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. This result indicates that there is an inherent limitation to the ability of systems to provide services in a consistent manner during network partitions.