Dynamic concurrent van Emde Boas array
Konrad Ku{\l}akowski

TL;DR
This paper introduces an improved dynamic concurrent data structure called the dcvEB array, based on the van Emde Boas tree, optimized for shared-memory multiprocessor systems with large key ranges.
Contribution
It presents an enhanced version of the cvEB array with memory optimization and improved search strategies, suitable for concurrent environments.
Findings
High performance with large key ranges
Memory usage optimized for dynamic growth and shrinkage
Effective successor and predecessor search strategies
Abstract
The growing popularity of shared-memory multiprocessor machines has caused significant changes in the design of concurrent software. In this approach, the concurrently running threads communicate and synchronize with each other through data structures in shared memory. Hence, the efficiency of these structures is essential for the performance of concurrent applications. The need to find new concurrent data structures prompted the author some time ago to propose the cvEB array modeled on the van Emde Boas Tree structure as a dynamic set alternative. This paper describes an improved version of that structure - the dcvEB array (Dynamic Concurrent van Emde Boas Array). One of the improvements involves memory usage optimization. This enhancement required the design of a tree which grows and shrinks at both: the top (root) and the bottom (leaves) level. Another enhancement concerns the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Parallel Computing and Optimization Techniques · Advanced Database Systems and Queries
