DROPS

Document

DOI: 10.4230/OASIcs.ICCSW.2017.7

Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data

Authors: Kjell Winblad

Published in: OASIcs, Volume 60, 2017 Imperial College Computing Student Workshop (ICCSW 2017)

Abstract

The need for scalable concurrent ordered set data structures with linearizable range query support is increasing due to the rise of multicore computers, data processing platforms and in-memory databases. This paper presents a new concurrent ordered set with linearizable range query support. The new data structure is based on the contention adapting search tree and an immutable data structure. Experimental results show that the new data structure is as much as three times faster compared to related data structures. The data structure scales well due to its ability to adapt the sizes of its immutable parts to the contention level and the sizes of the range queries.

Cite as

Kjell Winblad. Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data. In 2017 Imperial College Computing Student Workshop (ICCSW 2017). Open Access Series in Informatics (OASIcs), Volume 60, pp. 7:1-7:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{winblad:OASIcs.ICCSW.2017.7,
  author =	{Winblad, Kjell},
  title =	{{Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data}},
  booktitle =	{2017 Imperial College Computing Student Workshop (ICCSW 2017)},
  pages =	{7:1--7:13},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-059-0},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{60},
  editor =	{Leahy, Fergus and Franco, Juliana},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2017.7},
  URN =		{urn:nbn:de:0030-drops-84492},
  doi =		{10.4230/OASIcs.ICCSW.2017.7},
  annote =	{Keywords: linearizability, concurrent data structures, treap}
}

Search Results

Documents authored by Winblad, Kjell

Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data

Abstract

Cite as

Thanks for your feedback!

Could not send message