efficient / ARF

Related projects ⓘ

Alternatives and complementary repositories for ARF

• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 11 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆16Updated 5 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• wpaxos / paxi
  Paxos protocol variants framework
  ☆27Updated 6 years ago
• dgryski / libchash
  simple consistent hashing implementation
  ☆56Updated 6 years ago
• efficient / go-cuckoo
  A high-performance, memory-efficient concurrent hash table
  ☆36Updated 11 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 10 months ago
• ongardie / ark
  ☆10Updated 7 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆33Updated 5 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 6 years ago
• LPD-EPFL / lockin
  LOCKIN is a locking library with various lock algorithms implemented in header files for ease of use
  ☆10Updated 7 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆16Updated 9 years ago
• ucbrise / LatticeFlow
  ☆28Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• dgryski / go-marvin32
  Assembly-optimized Marvin32 hash function
  ☆12Updated 9 months ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 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.
  ☆40Updated 7 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• rescrv / pocdb
  Paxos-replicated key-value store in 3 hours or less.
  ☆25Updated 7 years ago
• PingCAP-QE / wreck-it
  This repository has been archived. See https://github.com/chaos-mesh/go-sqlancer for the new version
  ☆12Updated 4 years ago
• tidwall / algo
  Algo exposes the same hashing algorithms used by the Go runtime.
  ☆14Updated 6 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆16Updated 8 years ago
• mhuxtable / unbuckle
  High-performance, in-kernel key-value store
  ☆19Updated 10 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 4 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆17Updated 2 years ago