The Performance of Concurrent Red-Black Tree Algorithms

The Performance of Concurrent Red-Black Tree Algorithms (1998)

Cached

Download Links

[ftp.informatik.uni-freiburg.de]

Other Repositories/Bibliography

DBLP

by Sabine Hanke

Venue:	Lecture Notes in Computer Science
Citations:	8 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Performance of Concurrent Red-Black Tree Algorithms	user correction - Legacy Corrections
AUTHOR NAME	Sabine Hanke	SVM HeaderParse 0.1
AUTHOR AFFIL	; Institut fur Informatik, Universitat Freiburg; 1	SVM HeaderParse 0.2
AUTHOR ADDR	; Am Flughafen 17, 79110 Freiburg, Germany	SVM HeaderParse 0.1
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...	user correction - Legacy Corrections
YEAR	1998	user correction - Legacy Corrections
VENUE	Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	287--301	INFERENCE
VOLUME	1668	INFERENCE
CITATIONS	33 found	ParsCit 1.0