Alternatives and similar repositories for pmalloc

Users that are interested in pmalloc are comparing it to the libraries listed below

• penberg / hornet
  Hornet, a JVM optimized for low-latency applications.
  ☆53Updated 10 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• addthis / meshy
  ☆17Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• pgaref / ACaZoo
  A distributed key-value store based on replicated LSM-Trees
  ☆10Updated 8 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆20Updated 7 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆49Updated 11 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆88Updated 11 years ago
• oracle / nvm-direct
  A C library to support applications that map Non-Volatile Memory into their address space for load/store access.
  ☆56Updated 6 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆208Updated 9 years ago
• giannitedesco / cola
  Cache Oblivious Lookahead Arrays
  ☆27Updated 12 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• JoeLeavitt / SkipTrie
  ☆12Updated 8 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆58Updated 8 years ago
• HewlettPackard / nvthreads
  ☆26Updated 8 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆102Updated 7 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago