PrISM uses a Sampled History Queue to correlate row samples across windows, solving the non-selection problem in probabilistic RowHammer mitigation and cutting slowdown from 10.7% to 1.5% at threshold 250 versus prior methods.
Benchmarking cloud serving systems with ycsb
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
TurtleKV uses a balanced TurtleTree on-disk structure and flexible memory tuning knobs to deliver strong performance across inserts, mixed workloads, point queries, and scans in YCSB tests, matching or beating SplinterDB, RocksDB, and WiredTiger.
CIDER improves throughput of memory-disaggregated KV stores by up to 6.6x on YCSB by replacing optimistic synchronization with pessimistic synchronization, global write-combining, and a contention-aware scheme.
citing papers explorer
-
Loaded Dice: Solving the Non-Selection Problem for Scalable Probabilistic RowHammer Defense
PrISM uses a Sampled History Queue to correlate row samples across windows, solving the non-selection problem in probabilistic RowHammer mitigation and cutting slowdown from 10.7% to 1.5% at threshold 250 versus prior methods.
-
Dynamic read & write optimization with TurtleKV
TurtleKV uses a balanced TurtleTree on-disk structure and flexible memory tuning knobs to deliver strong performance across inserts, mixed workloads, point queries, and scans in YCSB tests, matching or beating SplinterDB, RocksDB, and WiredTiger.
-
CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization
CIDER improves throughput of memory-disaggregated KV stores by up to 6.6x on YCSB by replacing optimistic synchronization with pessimistic synchronization, global write-combining, and a contention-aware scheme.