2013
DOI: 10.1002/cpe.2995
|View full text |Cite
|
Sign up to set email alerts
|

A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative

Abstract: SUMMARYIncreasing demand for computationally efficient algorithms and processors has turned the attention of researchers toward parallel and concurrent solutions. Because the frequency of contemporary processors cannot be tweaked infinitely, the only hopes for squeezing more performance from computers are parallel processing and parallel computation. The important part of every parallel solution is concurrent data structures, which allow multithread programming environments to be taken advantage of. In this ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
20
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(21 citation statements)
references
References 40 publications
1
20
0
Order By: Relevance
“…The next method get(), similarly to insert(), first retrieves the current snapshot of the dcvEB array parameters (Listing: 5, Line: 60), then traverses the structure down from the root to the leaf following the subsequent level positions. The main difference between get() in the dcvEB array and get() from the previous version of the structure [15] is that currently the enabled bit in a summary does not guarantee the existence of the corresponding lower level array holder. Hence, the additional check whether the next AH is not actually nil is necessary (Listing: 5, Lines: 67 -68).…”
Section: Dcveb Array Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…The next method get(), similarly to insert(), first retrieves the current snapshot of the dcvEB array parameters (Listing: 5, Line: 60), then traverses the structure down from the root to the leaf following the subsequent level positions. The main difference between get() in the dcvEB array and get() from the previous version of the structure [15] is that currently the enabled bit in a summary does not guarantee the existence of the corresponding lower level array holder. Hence, the additional check whether the next AH is not actually nil is necessary (Listing: 5, Lines: 67 -68).…”
Section: Dcveb Array Methodsmentioning
confidence: 99%
“…The second and the major subroutine of delete() is delIntern(). In terms of the synchronization structure, it is similar to the original delete() method presented in [15]. The need, however, for effective array holder removal caused the necessity to introduce a few new elements into the code of the algorithm.…”
Section: Dcveb Array Methodsmentioning
confidence: 99%
See 3 more Smart Citations