Alternatives and similar repositories for libasock

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

• rescrv / pocdb
  Paxos-replicated key-value store in 3 hours or less.
  ☆25Updated 8 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆76Updated 8 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 7 years ago
• leaningtech / cheerp-bullet
  Bullet physics library ported to JavaScript with Cheerp
  ☆23Updated 10 years ago
• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 12 years ago
• malbrain / ARTful
  ARTful radix tree
  ☆13Updated 8 years ago
• maciekgajewski / coroutines
  Go-style coroutines and channels for C++
  ☆34Updated 12 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• rkuchumov / staccato
  C++11 Work-Stealing Task Scheduler
  ☆36Updated 6 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• njlr / buck-cpp-example
  A simple example of how to organize a C/C++ project that uses Buck build
  ☆11Updated 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.
  ☆44Updated 9 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago
• mbrossard / has
  Dynamic-language-like data structure for C
  ☆15Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 3 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 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
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆40Updated 9 years ago
• tylertreat / gatling
  Minimal pub/sub message queue in C.
  ☆23Updated 11 years ago
• daniel-j-h / DistributedSearch
  Distributed search engine in C++14, using nanomsg for communication, bond for serialization.
  ☆67Updated 10 years ago
• penberg / hornet
  Hornet, a JVM optimized for low-latency applications.
  ☆53Updated 10 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 9 years ago
• nidium / libapenetwork
  Fast cross-platform async network library
  ☆16Updated 6 years ago