Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. 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 the strictly balanced red-black tree and three relaxed balancing algorithms for red-black trees using the simulation of a multi-processor machine.
CITATION STYLE
Hanke, S. (1999). The performance of concurrent red-black tree algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1668, pp. 286–300). Springer Verlag. https://doi.org/10.1007/3-540-48318-7_23
Mendeley helps you to discover research relevant for your work.