A Top-down design of a parallel dictionary using skip lists

We 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 i...

Descripción completa

Detalles Bibliográficos
Autores: Gabarró Vallès, Joaquim|||0000-0003-3771-2813, Martínez Parra, Conrado|||0000-0003-1302-9067, Messeguer Peypoch, Xavier|||0000-0001-7430-4857
Tipo de recurso: informe técnico
Fecha de publicación:1994
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/96672
Acceso en línea:https://hdl.handle.net/2117/96672
Access Level:acceso abierto
Palabra clave:PRAM
EREW PRAM
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_2fda0b285f9ceada4eb2c916da7a630d
oai_identifier_str oai:upcommons.upc.edu:2117/96672
network_acronym_str ES
network_name_str España
repository_id_str
spelling A Top-down design of a parallel dictionary using skip listsGabarró Vallès, Joaquim|||0000-0003-3771-2813Martínez Parra, Conrado|||0000-0003-1302-9067Messeguer Peypoch, Xavier|||0000-0001-7430-4857PRAMEREW PRAMÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaWe 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.19941994-02-0120162016-11-15reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/96672reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/966722026-05-27T15:37:01Z
dc.title.none.fl_str_mv A Top-down design of a parallel dictionary using skip lists
title A Top-down design of a parallel dictionary using skip lists
spellingShingle A Top-down design of a parallel dictionary using skip lists
Gabarró Vallès, Joaquim|||0000-0003-3771-2813
PRAM
EREW PRAM
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short A Top-down design of a parallel dictionary using skip lists
title_full A Top-down design of a parallel dictionary using skip lists
title_fullStr A Top-down design of a parallel dictionary using skip lists
title_full_unstemmed A Top-down design of a parallel dictionary using skip lists
title_sort A Top-down design of a parallel dictionary using skip lists
dc.creator.none.fl_str_mv Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Martínez Parra, Conrado|||0000-0003-1302-9067
Messeguer Peypoch, Xavier|||0000-0001-7430-4857
author Gabarró Vallès, Joaquim|||0000-0003-3771-2813
author_facet Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Martínez Parra, Conrado|||0000-0003-1302-9067
Messeguer Peypoch, Xavier|||0000-0001-7430-4857
author_role author
author2 Martínez Parra, Conrado|||0000-0003-1302-9067
Messeguer Peypoch, Xavier|||0000-0001-7430-4857
author2_role author
author
dc.subject.none.fl_str_mv PRAM
EREW PRAM
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic PRAM
EREW PRAM
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description We 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.
publishDate 1994
dc.date.none.fl_str_mv 1994
1994-02-01
2016
2016-11-15
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/96672
url https://hdl.handle.net/2117/96672
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405505589346304
score 15,301603

Similares en LA Referencia