Show simple item record

dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.authorMartínez Parra, Conrado
dc.contributor.authorMesseguer Peypoch, Xavier
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationGabarro, J., Martinez, C., Messeguer, X. "A Top-down design of a parallel dictionary using skip lists". 1994.
dc.description.abstractWe present a top down design of a parallel PRAM dictionary using skip lists. More precisely, we give algorithms to search, insert or delete k elements in a skip list of n elements, in parallel. The algorithms are simple and easy to implement on real machines. All of them are iterative. They can be implemented in the EREW PRAM model using k processors in expected time O(log n + log k). The probability that there is a significant deviation from the expected time decreases as O(n^{-2}) for the search algorithm and as O(n^{-2}+k^{-2}) for the insertion and deletion algorithms.
dc.format.extent18 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherEREW PRAM
dc.titleA Top-down design of a parallel dictionary using skip lists
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorGabarro, J.; Martinez, C.; 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