Overview
Syllabus
Intro
Key-Value (KV) Storage Device
Key Challenges of Designing KV-SSD
Experiments using Hash-based KV-SSD
Problem of Hash-based KV-SSD
Problem of LSM-tree-based KV-SSD
Experiments using LSM-tree-based KV-SSD
Pink : New LSM-tree-based KV-SSD
Overview of LSM-tree in Pink Pink is based on key-value separated LSM-tree
Bounding Tail Latency
Memory Requirement
Reducing Search Overhead
Reducing Compaction I/O Pink without level-pinning
Reducing Sorting Time
Custom KV-SSD Prototype and Setup All algorithms for KV-SSD were implemented on ZCU102 board
Experiment: Throughput
Experiment: Latency
Experiment: Impact of Level-pinning
Experiment: Search Optimization Settings Pink (NO-OPT): Pink without prefix and range pointer Benchmark: YCSB-Load and YCSB-C
Taught by
USENIX