Show simple item record

dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.authorMesseguer Peypoch, Xavier
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationGabarro, J., Messeguer, X. "A Unified approach to concurrent and parallel algorithms on balanced data structures". 1997.
dc.description.abstractConcurrent 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.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherConcurrent algorithms
dc.subject.otherParallel algorithms
dc.subject.otherBalanced structures
dc.subject.otherAVL trees
dc.titleA Unified approach to concurrent and parallel algorithms on balanced data structures
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorGabarro, J.; Messeguer, X.

Files in this item


This item appears in the following Collection(s)

Show simple item record

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