Alternatives and similar repositories for cache-advisor:

Users that are interested in cache-advisor are comparing it to the libraries listed below

• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆69Updated 2 months ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆33Updated 2 years ago
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆63Updated last year
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆53Updated last year
• carllerche / mini-raft
  An implementation of Raft in Rust.
  ☆39Updated 2 years ago
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆67Updated 6 years ago
• rdaum / rart-rs
  An Adaptive Radix Tree implementation.
  ☆38Updated last year
• al8n / skl
  A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.
  ☆57Updated last month
• tokio-rs / simulation
  Framework for simulating distributed applications
  ☆100Updated 5 years ago
• benschulz / paxakos
  Rust implementation of Paxos consensus algorithm
  ☆106Updated 2 years ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆59Updated 6 months ago
• mkmik / heappy
  heap profiler for rust
  ☆27Updated last week
• komora-io / pagetable
  wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata
  ☆36Updated 8 months ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 7 months ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆111Updated 2 months ago
• udoprog / unicycle
  A futures abstraction that runs a set of futures which may complete in any order.
  ☆89Updated 3 weeks ago
• al8n / orderwal
  A generic-purpose, atomic, ordered, zero-copy read, zero-cost (in-place) write, Write-Ahead Log implementation for Rust.
  ☆20Updated 3 months ago
• monoio-rs / local-sync
  ☆47Updated 4 months ago
• Bajix / evlru
  An eventually consistent LRU designed for lock-free concurrent reads
  ☆22Updated 2 years ago
• antifuchs / ratelimit_meter
  A leaky-bucket-as-a-meter rate-limiting implementation in Rust
  ☆32Updated 4 years ago
• spacejam / seaslug
  scraps of a potential language
  ☆37Updated 4 years ago
• cloudflare / sliceslice-rs
  A fast implementation of single-pattern substring search using SIMD acceleration.
  ☆96Updated 6 months ago
• jonhoo / sento
  A lock-free, append-only atomic pool.
  ☆66Updated 2 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆71Updated 7 months ago
• Thomasdezeeuw / a10
  Library safely exposing the io_uring API.
  ☆61Updated last month
• pchickey / task-group
  ☆33Updated 2 years ago
• mosuka / meteora
  Distributed key-value store.
  ☆28Updated 3 years ago
• Lagrang / bztree-rs
  BzTree implementation for Rust
  ☆35Updated last year
• minghuaw / toy-rpc
  An async RPC in rust-lang that mimics golang's net/rpc
  ☆30Updated last year
• zzau13 / v_escape
  The simd optimized escape code
  ☆53Updated this week