Title:
|
Concurrent rebalancing of AVL trees: a fine-grained approach
|
Author:
|
Bougé, Luc; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier; Schabanel, Nicolas
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
Abstract:
|
We address the concurrent rebalancing of almost balanced binary
search trees (AVL trees). Such a rebalancing may for instance be
necessary after successive insertions and deletions of keys. We
show that this problem can be studied through the self-reorganization of distributed systems of nodes controlled by
local evolution rules in the line of the approach of Dijkstra and
Scholten. This yields a much simpler algorithm that the ones
previously known. As a by-product, this solves in a very general
setting an old question raised by H.T. Kung and P.L. Lehman: where
should rotations take place to rebalance arbitrary search trees? |
Subject(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Concurrent rebalancing -AVL trees -Concurrent algorithms -Concurrent insertions and deletions -Concurrent generalized rotations -Safety and liveness proofs |
Rights:
|
|
Document type:
|
Article - Published version Report |
Share:
|
|