Parallel update and search in skip lists
We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are clear and easy to explain and implement. All of them are iterative. They can be i...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1993 |
| 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/97223 |
| Acceso en línea: | https://hdl.handle.net/2117/97223 |
| Access Level: | acceso abierto |
| Palabra clave: | PRAM Parallel dictionary Skip lists Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | We present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are clear and easy to explain and implement. All of them are iterative. They can be implemented in the EREW PRAM model using O(k) processors in expected time O(log n + log k). |
|---|