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.date.accessioned2016-11-15T14:41:41Z
dc.date.available2016-11-15T14:41:41Z
dc.date.issued1994-02
dc.identifier.citationGabarro, J., Martinez, C., Messeguer, X. "A Top-down design of a parallel dictionary using skip lists". 1994.
dc.identifier.urihttp://hdl.handle.net/2117/96672
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.language.isoeng
dc.relation.ispartofseriesLSI-94-11-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherPRAM
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
local.identifier.drac1849480
dc.description.versionPostprint (published version)
local.citation.authorGabarro, J.; Martinez, C.; Messeguer, X.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record