Alternatives and similar repositories for Synch-Framework

Users that are interested in Synch-Framework are comparing it to the libraries listed below

• LLNL / umap
  User-space Page Management
  ☆108Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆134Updated 8 months ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆56Updated 2 weeks ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆158Updated 6 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 7 months 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…
  ☆181Updated 7 years ago
• ut-osa / strata
  Strata: A Cross Media File System
  ☆73Updated 2 years ago
• kozyraki / phoenix
  an API and runtime environment for data processing with MapReduce for shared-memory multi-core & multiprocessor systems.
  ☆95Updated last year
• oracle / nvm-direct
  A C library to support applications that map Non-Volatile Memory into their address space for load/store access.
  ☆57Updated 6 years ago
• snalli / nstore
  NVM Database from Carnegie-Mellon U
  ☆24Updated 5 years ago
• trigonak / ccbench
  A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).
  ☆78Updated 3 years ago
• parapluu / lock_benchmarking
  Benchmarks for locking algorithms as well as implementations of locking algorithms.
  ☆27Updated 7 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• pmem / rpma
  Remote Persistent Memory Access Library
  ☆104Updated 2 years ago
• pmodels / argobots
  Official Argobots Repository
  ☆141Updated last year
• ut-osa / assise
  ☆57Updated 3 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆82Updated 3 years ago
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆76Updated 4 years ago
• maleadt / pChase
  Pointer-chasing memory benchmark (forked from Doug Pase's code).
  ☆59Updated 11 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• eelejalde / rw-numa-locks
  NUMA-Aware Reader-Writer Locks
  ☆18Updated 11 years ago
• CARV-ICS-FORTH / parallax
  A persistent key-value store that is embeddable and optimized for fast storage.
  ☆35Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆116Updated 10 months ago
• snalli / mnemosyne-gcc
  GCC port of TM system Mnemosyne
  ☆32Updated 7 years ago
• memkind / memkind
  Memkind is an easy-to-use, general-purpose allocator which helps to fully utilize various kinds of memory available in the system, includ…
  ☆392Updated last year
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆16Updated 3 years ago