The Performance of Concurrent Red-Black Tree Algorithms (1998)
| Venue: | Lecture Notes in Computer Science |
| Citations: | 8 - 0 self |
BibTeX
@INPROCEEDINGS{Hanke98theperformance,
author = {Sabine Hanke},
title = {The Performance of Concurrent Red-Black Tree Algorithms},
booktitle = {Lecture Notes in Computer Science},
year = {1998},
pages = {287--301},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. The idea of relaxed balancing is to uncouple the rebalancing from the updating in order to speed up the update operations and to allow a high degree of concurrency. Many different relaxed balancing algorithms have been proposed, especially for red-black trees and AVL trees, but their performance in concurrent environments is not yet well understood. This paper presents an experimental comparison of three relaxed balancing algorithms for red-black trees. Using the simulation of a multi processor environment we study the performance of chromatic trees, the algorithm that is got by applying the general method of how to make strict balancing schemes relaxed to red-black trees, and the relaxed redblack tree. Furthermore, we compare the relaxed balancing algorithms with the standard red-black tree, i.e. the strictly balanced red-black tree combined with the locking scheme of El...
