Alternatives and similar repositories for perflock

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

• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 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.
  ☆43Updated 8 years ago
• efficient / qlease
  ☆24Updated 11 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• avikivity / fsqual
  Filesystem qualification tool
  ☆59Updated 3 years ago
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 5 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆69Updated 10 years ago
• vrv / FAWN-KV
  A Distributed Key-Value Store for FAWN
  ☆77Updated 14 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 6 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 5 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• aganesan4 / CORDS
  File-system fault injection framework for distributed storage systems
  ☆67Updated 7 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago