Public data structures: counters as a special case

  • Authors:

  • Hagit Brit;Shlomo Moran;Gadi Taubenfeld

  • Affiliations:

  • Computer Science Department, Israel Institute of Technology, The Technion, Technion, 32000 Haifa, Israel;Computer Science Department, Israel Institute of Technology, The Technion, Technion, 32000 Haifa, Israel;The Open University, 16 Klausner st., P.O.Box 39328, Tel-Aviv 61392, Israel

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 5.23

Visualization

Abstract

A public data structure is required to work correctly in a concurrent environment where many processes may try to access it, possibly at the same time. In implementing such a structure nothing can be assumed in advance about the number or the identities of the processes that might access it.While most of the known concurrent data structures are not public, there are few which are public. Interestingly, these public data structures all deal with various variants of counters, which are data structures that support two operations: increment and read.In this paper, we define the notion of a public data structure, and investigate several types of public counters. Then we give an optimal construction of public counters which satisfies a weak correcness condition, and show that there is no public counter which satisfies a stronger condition. It is hoped that this work will provide insights into the design of other, more complicated, public data structures.