Alternatives and similar repositories for MISON

Users that are interested in MISON 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 9 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 10 years ago
• plasma-umass / sheriff
  Sheriff consists of two tools: Sheriff-Detect, a false-sharing detector, and Sheriff-Protect, a false-sharing eliminator that you can lin…
  ☆32Updated 7 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆50Updated 12 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• google / hashtable-benchmarks
  ☆113Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆109Updated 8 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆28Updated last year
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆103Updated 7 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 6 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• microsoft / FishStore
  FishStore is a prototype fast ingestion and querying layer for flexible-schema data
  ☆232Updated 2 years ago
• PlatformLab / Arachne
  Core aware thread management system
  ☆239Updated 2 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
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 15 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆144Updated 6 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆96Updated 6 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• llnl / umap
  User-space Page Management
  ☆111Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago