Approach to Concurrent and Parallel Algorithms on Balanced Data Structures
Joaquim Gabarr, Xavier Messeguer, Jordi Girona Salgado · 1997
Concurrent and parallel algorithms are different. Howevel; in the case of dictionaries, both kinds of algorithms share many common points. We present a unified approach emphasizing these points. It is based on a careful analysis of the sequential algorithm, extracting from it the more basic facts, encapsulated later on as local rules. We apply the method to the insertion algorithms in AVL trees. All the concurrent and parallel insertion algorithms have two main phases. A percolation phase, moving the keys to be inserted down, and a rebalancing phase. Finally, some other algorithms and balanced structures are discussed.