Cache-Trie: Lock-Free Remove and Compaction Performance Benchmarks

An artifact containing source code and benchmarks from the paper "Efficient Lock-Free Removing and Compaction for the Cache-Trie Data Structure". The implementations, written in Scala using the Reactors.IO framework, present lock-free remove operations with and without compaction for cache-tries, which improve lookup and insert times from O(log n) to O(1). A performance evaluation compares these novel implementations against three similar data structures, with full details provided in the artifact-doc.pdf file.

Use Cases

• Benchmarking lock-free remove operations based on the described cache-trie implementations.
• Comparing performance of concurrent data structures based on the evaluation against three similar structures.
• Reproducing experimental results for academic research on cache-trie compaction.
• Studying the integration of a cache layer to improve algorithmic complexity from O(log n) to O(1) time.

Strengths

• Includes a performance evaluation comparing the novel implementations against three similar data structures.
• Provides full installation and benchmark running details in the artifact-doc.pdf file.
• Implements lock-free remove operations both with and without compaction as described in the accompanying paper.

Limitations

• Description metadata is limited; actual data quality requires manual inspection after download.
• Row count is unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred after download.

Provenance

Source

Aleksandar Prokopec

Collection Method

Source code artifact accompanying an academic paper.