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

View/Open
Cita com:
hdl:2117/96672
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
Files | Description | Size | Format | View |
---|---|---|---|---|
1400191537.pdf | 1,671Mb | View/Open |