Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.041 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
1400191537.pdf (1,671Mb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/96672

Show full item record
Gabarró Vallès, JoaquimMés informacióMés informacióMés informació
Martínez Parra, ConradoMés informacióMés informacióMés informació
Messeguer Peypoch, XavierMés informacióMés informacióMés informació
Document typeResearch report
Defense date1994-02
Rights accessOpen Access
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
Abstract
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.
CitationGabarro, J., Martinez, C., Messeguer, X. "A Top-down design of a parallel dictionary using skip lists". 1994. 
Is part ofLSI-94-11-R
URIhttp://hdl.handle.net/2117/96672
Collections
  • ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals - Reports de recerca [140]
  • Departament de Ciències de la Computació - Reports de recerca [1.109]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
1400191537.pdf1,671MbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina