A unified approach to concurrent and parallel algorithms on balanced data structures

Authors:
J. Gabarro;X. Messeguer
Affiliations:
-;-
Venue:
SCCC '97 Proceedings of the 17th International Conference of the Chilean Computer Science Society
Year:
1997

Citing 0
Cited 3

Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
View Serializable Updates of Concurrent Index Structures

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Skip graphs

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent and parallel algorithms are different. However, 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.