Parallel Balanced Binary Tree Structures
☆121Mar 15, 2025Updated last year
Alternatives and similar repositories for PAM
Users that are interested in PAM are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- CPAM: Compressed Parallel Augmented Maps☆27Aug 18, 2025Updated last year
- ☆26Jan 2, 2021Updated 5 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆441Mar 12, 2026Updated 5 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Jun 24, 2019Updated 7 years ago
- GBBS: Graph Based Benchmark Suite☆226Jun 2, 2026Updated 2 months ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- New version of pbbs benchmarks☆97Nov 25, 2025Updated 9 months ago
- ☆16Jan 24, 2025Updated last year
- ☆11May 29, 2024Updated 2 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Mar 10, 2022Updated 4 years ago
- NUMA-aware parallel packed CSR data structure for large-scale dynamic graph data☆14May 11, 2026Updated 3 months ago
- Graphs analytics on collections of views!☆36Nov 28, 2023Updated 2 years ago
- Library for lock-free locks☆87Jun 26, 2023Updated 3 years ago
- ☆18Jan 10, 2022Updated 4 years ago
- ☆23Mar 31, 2021Updated 5 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 8 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 7 years ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆58Apr 5, 2021Updated 5 years ago
- ☆40Jun 20, 2020Updated 6 years ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆495Feb 18, 2024Updated 2 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆29Jun 18, 2023Updated 3 years ago
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆39May 11, 2022Updated 4 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆186Jan 19, 2018Updated 8 years ago
- A simple, reference implementation of a B^e-tree☆168Mar 25, 2019Updated 7 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Apr 10, 2024Updated 2 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆454Jan 10, 2025Updated last year
- A computation-centric distributed graph processing system.☆329Aug 15, 2021Updated 5 years ago
- Parallel, batch-dynamic kdtree☆13Jan 19, 2022Updated 4 years ago
- [VLDB'23] A Skew-Resistant Index for Processing-in-Memory☆29Jan 5, 2026Updated 7 months ago
- A Multicore, NUMA Optimised Data Stream Processing System☆41Dec 14, 2022Updated 3 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Feb 14, 2022Updated 4 years ago
- Fast Multiple Independent Random Number Sequences Generation on FPGAs☆15Sep 19, 2021Updated 4 years ago
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆76Dec 8, 2025Updated 8 months ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated last year
- ☆33Oct 28, 2020Updated 5 years ago
- Pointer-chasing memory benchmark (forked from Doug Pase's code).☆62Dec 20, 2013Updated 12 years ago
- ☆153Mar 11, 2023Updated 3 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Jun 26, 2020Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Sep 24, 2010Updated 15 years ago
- ☆20Dec 27, 2021Updated 4 years ago