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
  ☆109Updated last year
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆76Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 5 months ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• kozyraki / phoenix
  an API and runtime environment for data processing with MapReduce for shared-memory multi-core & multiprocessor systems.
  ☆96Updated last year
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆128Updated 5 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
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• oracle / nvm-direct
  A C library to support applications that map Non-Volatile Memory into their address space for load/store access.
  ☆56Updated 6 years ago
• tuhhosg / exmap
  ☆48Updated last year
• ut-osa / strata
  Strata: A Cross Media File System
  ☆73Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆156Updated 6 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 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
• multicore-locks / litl
  LiTL: Library for Transparent Lock Interposition
  ☆84Updated 2 years ago
• maleadt / pChase
  Pointer-chasing memory benchmark (forked from Doug Pase's code).
  ☆58Updated 11 years ago
• snalli / nstore
  NVM Database from Carnegie-Mellon U
  ☆24Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• CARV-ICS-FORTH / parallax
  A persistent key-value store that is embeddable and optimized for fast storage.
  ☆35Updated 9 months ago
• sihangliu / pmtest
  ☆28Updated 5 years ago
• snalli / mnemosyne-gcc
  GCC port of TM system Mnemosyne
  ☆32Updated 6 years ago
• urcs-sync / Montage
  Montage is a system for building fast buffered persistent data structures on nonvolatile memory.
  ☆15Updated 3 years ago
• kozyraki / stamp
  the Stanford Transactional Applications for Multi-Processing; a benchmark suite for transactional memory research
  ☆43Updated 3 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…
  ☆390Updated last year
• bingmann / pmbw
  Parallel Memory Bandwidth Measurement / Benchmark Tool
  ☆111Updated 3 years ago
• urcs-sync / ralloc
  Recoverable lock-free allocator based on LRMalloc
  ☆47Updated 4 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• ut-osa / assise
  ☆57Updated 3 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago