---
res:
  bibo_abstract:
  - A standard design pattern found in many concurrent data structures, such as hash
    tables or ordered containers, is an alternation of parallelizable sections that
    incur no data conflicts and critical sections that must run sequentially and are
    protected with locks. A lock can be viewed as a queue that arbitrates the order
    in which the critical sections are executed, and a natural question is whether
    we can use stochastic analysis to predict the resulting throughput. As a preliminary
    evidence to the affirmative, we describe a simple model that can be used to predict
    the throughput of coarse-grained lock-based algorithms. We show that our model
    works well for CLH lock, and we expect it to work for other popular lock designs
    such as TTAS, MCS, etc.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vitaly
      foaf_name: Aksenov, Vitaly
      foaf_surname: Aksenov
  - foaf_Person:
      foaf_givenName: Dan-Adrian
      foaf_name: Alistarh, Dan-Adrian
      foaf_surname: Alistarh
      foaf_workInfoHomepage: http://www.librecat.org/personId=4A899BFC-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0003-3650-940X
  - foaf_Person:
      foaf_givenName: Petr
      foaf_name: Kuznetsov, Petr
      foaf_surname: Kuznetsov
  bibo_doi: 10.1145/3212734.3212785
  dct_date: 2018^xs_gYear
  dct_identifier:
  - UT:000458186900052
  dct_isPartOf:
  - http://id.crossref.org/issn/9781450357951
  dct_language: eng
  dct_publisher: ACM@
  dct_title: 'Brief Announcement: Performance prediction for coarse-grained locking@'
...