(Enter summary)
Abstract: . We introduce a relaxed version of RedBlack trees. As concurrent
algorithms on balanced search trees are nowadays based on local
rules, we propose a set of fine-grained local rules that take more advantage
of concurrency than previous approaches. Based on them we design
a rebalancing concurrent algorithm and prove its correctness. Finally we
sketch how to complete this algorithm to include concurrent insertions
and deletions.
Keywords: Concurrent algorithms, RedBlack trees, Concurrent... (Update)
Context of citations to this paper: More
.... b) trees [13, 21] B trees [4] 2 3 trees [12, 2] in [24, 17, 18] In [19] a general result for balanced trees was developed, and in [31, 20, 11, 9, 23], some variations of the standard schemes were investigated. Locking in a parallel setting was discussed in [26, 6] In this...
...trees where multiple blackness is accumulated by overweighted nodes. In order to allow also deletions, recently Messeguer and Valles [25] proposed a combination of hyperred black trees and chromatic trees, which they call hyperchromatic tree. They extend chromatic trees by...
Cited by: More
The Performance of Concurrent Red-Black Tree Algorithms - Hanke (1998)
(Correct)
Complexity of Layered Binary Search Trees with Relaxed Balance - Jacobsen, Larsen (1999)
(Correct)
Active bibliography (related documents): More All
0.2: A Unified Approach to Concurrent and Parallel Algorithms on .. - Gabarro, Messeguer
(Correct)
0.2: Relaxed Balance through Standard Rotations - Larsen, Soisalon-Soininen.. (1997)
(Correct)
0.2: Height-relaxed AVL rebalancing: A unified.. - Bougé, Gabarró.. (1998)
(Correct)
Similar documents based on text: More All
0.6: Supernode Binary Search Trees - Haejae Jung And
(Correct)
0.4: Query, PACS and simple-PAC Learning - Castro, Guijarro (1998)
(Correct)
0.3: Concurrent Rebalancing on HyperRed-Black Trees - Gabarro, Messeguer, Riu (1997)
(Correct)
Related documents from co-citation: More All
3: Efficient Rebalancing of Chromatic Search Trees
- Boyar, Larsen - 1992
3: Amortization results for chromatic search trees (context) - Boyar, Fagerberg et al. - 1994
3: trees with relaxed balance (context) - Larsen, Fagerberg - 1995
BibTeX entry: (Update)
Xavier Messeguer and Borja Valles. HyperChromatic trees: a finegrained approach to distributed algorithms on RedBlack trees. Tech. Report LSI-98-13-R, Departament de Llenguatges i Sistemes Inform- `atics, Universitat Polit`ecnica de Catalunya, 1998. http://citeseer.ist.psu.edu/messeguer98hyperchromatic.html More
@misc{ messeguer98hyperchromatic,
author = "X. Messeguer and B. Valles",
title = "HyperChromatic trees: a finegrained approach to distributed algorithms
on RedBlack trees",
text = "Xavier Messeguer and Borja Valles. HyperChromatic trees: a finegrained
approach to distributed algorithms on RedBlack trees. Tech. Report LSI-98-13-R,
Departament de Llenguatges i Sistemes Inform- `atics, Universitat Polit`ecnica
de Catalunya, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/messeguer98hyperchromatic.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
129
the fly garbage collection: an exercise in cooperation (context) - Dijkstra, Lamport et al. - 1978
22
fly optimization of data structures (context) - Kessels - 1983
10
Amortization results for chromatic search trees (context) - Boyar, Fagerberg et al. - 1997
5
Concurrent rebalancing on HyperRedBlack trees (context) - Gabarr'o, Messeguer et al. - 1997
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC