Using histories to implement atomic objects

  • Authors:
  • Tony P. Ng

  • Affiliations:
  • Univ. of Illinois at Urbana-Champaign, Urbana

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we describe an approach to implementing atomicity. Atomicity requires that computations appear to be all-or-nothing and executed in a serialization order. The approach we describe has three characteristics. First, it utilizes the semantics of an application to improve concurrency. Second, it reduces the complexity of application-dependent synchronization code by analyzing the process of writing it. Third, our approach hides the protocol used to arrive at a serialization order from the applications. As a result, different protocols can be used without affecting the applications. Our approach uses a history abstraction. The history captures the ordering relationship among concurrent computations. By determining what types of computations exist in the history and their parameters, a computation can determine whether it can proceed.