Alternatives and similar repositories for Flat-Combining:

Users that are interested in Flat-Combining are comparing it to the libraries listed below

• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 2 months ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆18Updated 2 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆49Updated 11 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• trigonak / ccbench
  A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).
  ☆75Updated 2 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• eelejalde / rw-numa-locks
  NUMA-Aware Reader-Writer Locks
  ☆18Updated 10 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆41Updated 2 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 8 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated 2 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆206Updated 9 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 4 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆39Updated 2 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• pmem / pmemkv-bench
  Benchmarking tools for pmemkv
  ☆22Updated last year
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆22Updated 9 years ago