HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees
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 that previous approaches. Based on them we design a rebalancing concurrent algor...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/84042 |
| Acceso en línea: | https://hdl.handle.net/2117/84042 |
| Access Level: | acceso abierto |
| Palabra clave: | RedBlack trees Concurrent algorithms Concurrent rebalancing Safety and liveness proofs Local rules Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | 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 that 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. |
|---|