---
res:
  bibo_abstract:
  - "Batching is a technique that stores multiple keys/values in each node of a data
    structure. In sequential search data structures, batching reduces latency by reducing
    the number of cache misses and shortening the chain of pointers to dereference.
    Applying batching to concurrent data structures is challenging, because it is
    difficult to maintain the search property and keep contention low in the presence
    of batching.\r\nIn this paper, we present a general methodology for leveraging
    batching in concurrent search data structures, called BatchBoost. BatchBoost builds
    a search data structure from distinct \"data\" and \"index\" layers. The data
    layer’s purpose is to store a batch of key/value pairs in each of its nodes. The
    index layer uses an unmodified concurrent search data structure to route operations
    to a position in the data layer that is \"close\" to where the corresponding key
    should exist. The requirements on the index and data layers are low: with minimal
    effort, we were able to compose three highly scalable concurrent search data structures
    based on three original data structures as the index layers with a batched version
    of the Lazy List as the data layer. The resulting BatchBoost data structures provide
    significant performance improvements over their original counterparts.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vitaly
      foaf_name: Aksenov, Vitaly
      foaf_surname: Aksenov
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Anoprenko, Michael
      foaf_surname: Anoprenko
  - foaf_Person:
      foaf_givenName: Alexander
      foaf_name: Fedorov, Alexander
      foaf_surname: Fedorov
      foaf_workInfoHomepage: http://www.librecat.org/personId=2e711909-896a-11ed-bdf8-eb0f5a2984c6
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Spear, Michael
      foaf_surname: Spear
  bibo_doi: 10.4230/LIPIcs.DISC.2023.35
  bibo_volume: 281
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959773010
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: 'Brief announcement: BatchBoost: Universal batching for concurrent data
    structures@'
...