License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2018.8
URN: urn:nbn:de:0030-drops-100688
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/10068/
Ko, Jeremy
The Amortized Analysis of a Non-blocking Chromatic Tree
Abstract
A non-blocking chromatic tree is a type of balanced binary search tree where multiple processes can concurrently perform search and update operations. We prove that a certain implementation has amortized cost O(dot{c} + log n) for each operation, where dot{c} is the maximum number of concurrent operations at any point during the execution and n is the maximum number of keys in the tree during the operation. This amortized analysis presents new challenges compared to existing analyses of other non-blocking data structures.
BibTeX - Entry
@InProceedings{ko:LIPIcs:2018:10068,
author = {Jeremy Ko},
title = {{The Amortized Analysis of a Non-blocking Chromatic Tree}},
booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS 2018)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-098-9},
ISSN = {1868-8969},
year = {2018},
volume = {125},
editor = {Jiannong Cao and Faith Ellen and Luis Rodrigues and Bernardo Ferreira},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10068},
URN = {urn:nbn:de:0030-drops-100688},
doi = {10.4230/LIPIcs.OPODIS.2018.8},
annote = {Keywords: amortized analysis, non-blocking, lock-free, balanced binary search trees}
}
|
Keywords: |
|
amortized analysis, non-blocking, lock-free, balanced binary search trees |
|
Collection: |
|
22nd International Conference on Principles of Distributed Systems (OPODIS 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
15.01.2019 |
