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

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.Postprint (published version

Fonaments teòrics del paral·lelisme : apunts del curs de doctorat

This manuscript consists of the lecture notes for the doctorate course Theoretical Foundations of Parallelism taugth in 1994. The notes were written by the students and they are not meant to be in polished form.Preprin