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

View/Open
Document typeResearch report
Defense date1997-07
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
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.
CitationGabarro, J., Messeguer, X. "A Unified approach to concurrent and parallel algorithms on balanced data structures". 1997.
Is part ofLSI-97-33-R
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
R97-33.pdf | 139,1Kb | View/Open |