Height-relaxed AVL rebalancing: a unified, fine-grained approach to concurrent dictionaries
暂无分享,去创建一个
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. Based on the basic rebalancing framework, we describe
algorithms to manage concurrent insertion and deletion of keys.
Finally, this approach is used to emulate other well known
concurrent AVL algorithms.
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?