Simple Executions of Snapshot Implementations Academic Article uri icon


  • Abstract: The well known snapshot primitive in concurrent programming allows for n- asynchronous processes to write values to an array of single-writer registers and, for each process, to take a snapshot of these registers. In this paper we provide a formulation of the well known linearizability condition for snapshot algorithms in terms of the existence of certain mathematical functions. In addition, we identify a simplifying property of snapshot implementations we call" schedule-based algorithms". This property is natural to assume …

publication date

  • February 10, 2015