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 8 months ago
- ☆25Jan 2, 2021Updated 5 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆433Mar 12, 2026Updated last month
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Jun 24, 2019Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆225Apr 12, 2026Updated 2 weeks ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆16Jan 24, 2025Updated last year
- New version of pbbs benchmarks☆97Nov 25, 2025Updated 5 months ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Mar 10, 2022Updated 4 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Oct 24, 2022Updated 3 years ago
- Graphs analytics on collections of views!☆36Nov 28, 2023Updated 2 years ago
- Library for lock-free locks☆85Jun 26, 2023Updated 2 years ago
- ☆17Jan 10, 2022Updated 4 years ago
- ☆24Mar 31, 2021Updated 5 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆58Apr 5, 2021Updated 5 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Dec 4, 2019Updated 6 years ago
- Ligra: A Lightweight Graph Processing Framework for Shared Memory☆494Feb 18, 2024Updated 2 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆29Jun 18, 2023Updated 2 years ago
- [VLDB'23] A Skew-Resistant Index for Processing-in-Memory☆27Jan 5, 2026Updated 3 months ago
- RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s☆39May 11, 2022Updated 3 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆183Jan 19, 2018Updated 8 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A simple, reference implementation of a B^e-tree☆165Mar 25, 2019Updated 7 years ago
- A computation-centric distributed graph processing system.☆330Aug 15, 2021Updated 4 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆449Jan 10, 2025Updated last year
- A simple implementation of the packed memory array☆20Sep 1, 2013Updated 12 years ago
- A Multicore, NUMA Optimised Data Stream Processing System☆40Dec 14, 2022Updated 3 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Feb 14, 2022Updated 4 years ago
- Parallel, batch-dynamic kdtree☆13Jan 19, 2022Updated 4 years ago
- Fast Multiple Independent Random Number Sequences Generation on FPGAs☆15Sep 19, 2021Updated 4 years ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆186Jan 5, 2026Updated 3 months ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆76Dec 8, 2025Updated 4 months ago
- C++ driver to evaluate updates in dynamic structural graphs☆19Jun 14, 2022Updated 3 years ago
- (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.☆28May 12, 2025Updated 11 months ago
- ☆33Oct 28, 2020Updated 5 years ago
- Comparison of graph processing systems.☆23Jun 18, 2017Updated 8 years ago
- Pointer-chasing memory benchmark (forked from Doug Pase's code).☆61Dec 20, 2013Updated 12 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Jun 26, 2020Updated 5 years ago