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
  ☆70Updated 3 months ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆33Updated 3 years ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆53Updated this week
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆63Updated last year
• carllerche / mini-raft
  An implementation of Raft in Rust.
  ☆39Updated 2 years ago
• tokio-rs / simulation
  Framework for simulating distributed applications
  ☆101Updated 5 years ago
• komora-io / pagetable
  wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata
  ☆37Updated 9 months ago
• mkmik / heappy
  heap profiler for rust
  ☆28Updated 3 weeks ago
• ambaxter / bbolt-rs
  Port of bbolt in Rust
  ☆65Updated 8 months ago
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆67Updated 7 years ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆113Updated 3 months ago
• spacejam / rsdb
  rust database engineering toolkit
  ☆33Updated 3 years ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆61Updated 7 months ago
• benschulz / paxakos
  Rust implementation of Paxos consensus algorithm
  ☆109Updated 2 years ago
• sunfishcode / io-lifetimes
  A low-level I/O ownership and borrowing library
  ☆101Updated 5 months ago
• knizhnik / yakv
  Yet another key-value storage for Rust
  ☆71Updated 3 years ago
• Thomasdezeeuw / a10
  Library safely exposing the io_uring API.
  ☆62Updated 2 months ago
• PSeitz / binggan
  Benchmarking library for stable Rust
  ☆38Updated last month
• udoprog / unicycle
  A futures abstraction that runs a set of futures which may complete in any order.
  ☆90Updated 2 months ago
• al8n / skl
  A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.
  ☆58Updated 3 months ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 9 months ago
• cloudflare / sliceslice-rs
  A fast implementation of single-pattern substring search using SIMD acceleration.
  ☆96Updated 8 months ago
• monoio-rs / local-sync
  ☆47Updated 5 months ago
• Bajix / evlru
  An eventually consistent LRU designed for lock-free concurrent reads
  ☆22Updated 2 years ago
• jonhoo / sento
  A lock-free, append-only atomic pool.
  ☆67Updated 3 years ago
• komora-io / inline-array
  ☆11Updated 7 months ago
• rdaum / rart-rs
  An Adaptive Radix Tree implementation.
  ☆39Updated last year
• alexforster / pdu
  Small, fast, and correct L2/L3/L4 packet parser.
  ☆59Updated last year
• komora-io / fault-injection
  trigger io::Error's in test, and annotate their source
  ☆30Updated last year
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆79Updated 8 months ago