Abstract.
Search trees with relaxed balance were introduced with the aim of facilitating fast updating on shared-memory asynchronous parallel architectures. To obtain this, rebalancing has been uncoupled from the updating, so extensive locking in connection with updates is avoided. Rebalancing is taken care of by background processes, which do only a constant amount of work at a time before they release locks. Thus, the rebalancing and the associated locks are very localized in time as well as in space. In particular, there is no exclusive locking of whole paths. This means that the amount of parallelism possible is not limited by the height of the tree.
Search trees with relaxed balance have been obtained by adapting standard sequential search trees to this new paradigm; clearly using similar techniques in each case, but no general result has been obtained. We show how any search tree with local bottom-up rebalancing can be used in a relaxed variant, preserving the complexity of the rebalancing from the sequential case. Additionally, we single out the one high level locking mechanism that a parallel implementation must provide in order to guarantee cons istency.
Though the ideas have come from search trees, the result presented here applies to tree structures in general, where operations initiated at the leaves progress towards the root in constant-sized steps.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 10 September 1999 / 9 April 2001
Rights and permissions
About this article
Cite this article
Larsen, K., Ottmann, T. & Soisalon-Soininen, E. Relaxed balance for search trees with local rebalancing. Acta Informatica 37, 743–763 (2001). https://doi.org/10.1007/PL00013303
Issue Date:
DOI: https://doi.org/10.1007/PL00013303