Trading Consistency for Availability in Distributed Systems

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.