Timing conditions for linearizability in uniform counting networks

Nancy Lynch, Nir Shavit, Alex Shvartsman, Dan Touitou

Research output: Contribution to journalArticlepeer-review

Abstract

Counting networks are concurrent data structures that serve as building blocks in the design of highly scalable concurrent data structures in a way that eliminates sequential bottlenecks and contention. Linearizable counting networks assure that the order of the values returned by the network reflects the real-time order in which they were requested. Linearizability is an important consistency condition for concurrent data structures, as it simplifies proofs and enhances compositionality. Though most counting networks are not linearizable, this paper presents a precise characterization of the timing conditions under which uniform non-linearizable networks exhibit linearizable behavior. Uniformity is a common structuring property of almost all published counting networks: a uniform network is made of "balancers" and "wires" so that each balancer lies on some path from inputs to outputs, and all paths from inputs to outputs have equal lengths. Our results include the following simple condition: if the time it takes a slow token to traverse a "wire" or "balancer" is no more than twice that of a fast token, the network is linearizable. Surprisingly, the timing measure in this condition is local to the individual "wires" and "balancers" of the network, that is, it is independent of network depth. We use our timing measure to mathematically explain our empirical findings: that in a variety of highly concurrent execution scenarios tested on a simulated shared memory multiprocessor, the Bitonic counting networks of Aspnes, Herlihy, and Shavit exhibit completely linearizable behavior, and when linearizability is violated, the percentage of violations is relatively small. Herlihy, Shavit, and Waarts have shown that counting networks that achieve linearizability under all circumstances must pay the penalty of linear time latency. Our results suggest that for systems in which timing anomalies occur infrequently, such linear delays may be an unnecessary burden on applications that are willing to incur occasional non-linearizability.

Original languageEnglish (US)
Pages (from-to)67-91
Number of pages25
JournalTheoretical Computer Science
Volume220
Issue number1
DOIs
StatePublished - Jun 6 1999
Externally publishedYes

Keywords

  • Counting network
  • Data structure
  • Empirical evaluation
  • Linearizability
  • Timing analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Timing conditions for linearizability in uniform counting networks'. Together they form a unique fingerprint.

Cite this