Title:
|
Where should concurrent rotations take place to rebalance a distributed arbitrary search tree?
|
Author:
|
Bougé, Luc; Gabarró Vallès, Joaquim; Messeguer Peypoch, Xavier
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
Abstract:
|
We address the concurrent insertion and deletion of keys in binary almost balanced search trees (AVL trees). We show that this problem can be studied through the self-reorganization of distributed systems of processes controlled by local evolution rules in the line of the approach of Dijkstra and Scholten. In particular, we show that our approach encapsulates a number of previous attempts described in the literature. 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 trees? |
Subject(s):
|
-Àrees temàtiques de la UPC::Informàtica::Programació -AVL trees -Distributed systems -Self-reorganization -Concurrent rotations |
Rights:
|
|
Document type:
|
Article - Published version Report |
Share:
|
|