Alternatives and similar repositories for simulation

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

• jonhoo / bustle
  A benchmarking harness for concurrent key-value collections
  ☆119Updated 2 years ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆72Updated 8 months ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆54Updated 2 months ago
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆63Updated 2 years ago
• spacejam / paxos
  simple CASPaxos implementation written in rust on top of a simulator for finding bugs quickly
  ☆141Updated 5 years ago
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆68Updated 7 years ago
• Gregory-Meyer / cht
  Lockfree resizeable concurrent hash table.
  ☆54Updated 3 years ago
• vertexclique / lever
  Pillars for Transactional Systems and Data Grids
  ☆133Updated last year
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆85Updated 2 years ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆66Updated last year
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆37Updated 3 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆84Updated last year
• benschulz / paxakos
  Rust implementation of Paxos consensus algorithm
  ☆115Updated 2 years ago
• xxuejie / diviner
  A FoundationDB style deterministic testing framework for async/await Rust
  ☆32Updated 5 years ago
• khonsulabs / okaywal
  A Write Ahead Log (WAL) implementation in Rust
  ☆230Updated last year
• spacejam / rsdb
  rust database engineering toolkit
  ☆32Updated 4 years ago
• saligrama / concache
  A linked-list based, lock-free concurrent hashmap in Rust.
  ☆164Updated 5 years ago
• crepererum-oss / pdatastructs.rs
  Simple probabilistic data structures
  ☆147Updated last week
• kompics / kompact
  A Component System in Rust
  ☆107Updated 6 months ago
• al8n / skl
  A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.
  ☆62Updated 7 months ago
• khonsulabs / nebari
  A pure Rust database implementation using an append-only B-Tree file format.
  ☆274Updated 2 years ago
• tikv / minstant
  Performant time measuring in Rust
  ☆195Updated last year
• taiki-e / futures-async-stream
  Async stream for Rust and the futures crate.
  ☆188Updated last week
• facebookexperimental / allocative
  Library and proc macro to analyze memory usage of data structures in rust.
  ☆166Updated last month
• vertexclique / nuclei
  Proactive IO & Runtime system
  ☆275Updated last year
• komora-io / concurrent-map
  lock-free B+ tree
  ☆299Updated last year
• tokio-rs / async-backtrace
  ☆202Updated last year
• zowens / paxos-rs
  Paxos implementation in Rust
  ☆78Updated 3 weeks ago
• jonhoo / sento
  A lock-free, append-only atomic pool.
  ☆68Updated 3 years ago
• SchrodingerZhu / snmalloc-rs
  rust bindings of snmalloc
  ☆142Updated last month