Alternatives and similar repositories for diamond

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

• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆32Updated 12 years ago
• cmu-db / peloton-test
  SQL Testing Framework for the Peloton DBMS
  ☆20Updated 8 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• ix-project / zygos
  ☆33Updated 8 years ago
• NYU-NEWS / janus
  ☆51Updated last year
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 5 years ago
• brownsys / X-Trace
  X-Trace is a tool that provides fine-grained visibility into large, complex distributed systems. It can be used by application developers…
  ☆28Updated 11 years ago
• columbia / crane
  Transparent Paxos
  ☆45Updated 6 years ago
• ramanala / PACE
  Protocol-Aware Correlated Crash Explorer for Distributed Storage Systems
  ☆15Updated 9 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆21Updated 8 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆50Updated 12 years ago
• UWSysLab / Eris
  Eris distributed transactions
  ☆52Updated 7 years ago
• uwsampa / grappa
  Grappa: scaling irregular applications on commodity clusters
  ☆159Updated 8 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 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…
  ☆181Updated 7 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 7 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 5 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• utsaslab / optfs
  The Optimistic File System (OptFS) is a Linux ext4 variant that implements Optimistic Crash Consistency, a new approach to crash consiste…
  ☆35Updated 12 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆43Updated 8 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• hku-systems / apus
  An RDMA-powered, fast, and scalable Paxos protocol
  ☆26Updated 6 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago