Alternatives and similar repositories for adaptive-replacement-cache

Users that are interested in adaptive-replacement-cache are comparing it to the libraries listed below

• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• efficient / memc3
  MemC3
  ☆156Updated 8 years ago
• avsm / ipc-bench
  Latency benchmarks of Unix IPC mechanisms
  ☆100Updated 3 months ago
• htot / crc32c
  Fastest crc32c algorithms for i686 and x86_64 including benchmarks
  ☆92Updated 8 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆99Updated 7 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆138Updated 6 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• efficient / nvram
  Tools for safe management of persistent main memory.
  ☆28Updated 12 years ago
• hgst / libnvme
  User level NVMe driver library
  ☆70Updated 4 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆90Updated 3 years ago
• jvirkki / libbloom
  A simple and small bloom filter implementation in plain C.
  ☆303Updated 3 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆166Updated 4 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 weeks ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆90Updated 11 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 5 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆182Updated 8 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆193Updated 3 months ago
• Begun / lockfree-malloc
  The world's first Web-scale memory allocator
  ☆109Updated 7 years ago
• google / file-system-stress-testing
  A tool that can be used to stress test POSIX filesystems.
  ☆104Updated 9 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆55Updated 10 years ago
• j0sh / radixtree
  The finest radix tree this side of the Linux kernel.
  ☆34Updated 10 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆252Updated 5 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆42Updated last year
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago