---
res:
  bibo_abstract:
  - "Linearizability requires that the outcome of calls by competing threads to a
    concurrent data structure is the same as some sequential execution where each
    thread has exclusive access to the data structure. In an ordered data structure,
    such as a queue or a stack, linearizability is ensured by requiring threads commit
    in the order dictated by the sequential semantics of the data structure; e.g.,
    in a concurrent queue implementation a dequeue can only remove the oldest element.
    \r\nIn this paper, we investigate the impact of this strict ordering, by comparing
    what linearizability allows to what existing implementations do. We first give
    an operational definition for linearizability which allows us to build the most
    general linearizable implementation as a transition system for any given sequential
    specification. We then use this operational definition to categorize linearizable
    implementations based on whether they are bound or free. In a bound implementation,
    whenever all threads observe the same logical state, the updates to the logical
    state and the temporal order of commits coincide. All existing queue implementations
    we know of are bound. We then proceed to present, to the best of our knowledge,
    the first ever free queue implementation. Our experiments show that free implementations
    have the potential for better performance by suffering less from contention.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Ali
      foaf_name: Sezgin, Ali
      foaf_surname: Sezgin
      foaf_workInfoHomepage: http://www.librecat.org/personId=4C7638DA-F248-11E8-B48F-1D18A9856A87
  bibo_doi: 10.15479/AT:IST-2013-123-v1-1
  dct_date: 2013^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2664-1690
  dct_language: eng
  dct_publisher: IST Austria@
  dct_title: How free is your linearizable concurrent data structure?@
...