Completed
Experiments using LSM-tree-based KV-SSD
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
PinK - High-speed In-storage Key-value Store with Bounded Tails
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Key-Value (KV) Storage Device
- 3 Key Challenges of Designing KV-SSD
- 4 Experiments using Hash-based KV-SSD
- 5 Problem of Hash-based KV-SSD
- 6 Problem of LSM-tree-based KV-SSD
- 7 Experiments using LSM-tree-based KV-SSD
- 8 Pink : New LSM-tree-based KV-SSD
- 9 Overview of LSM-tree in Pink Pink is based on key-value separated LSM-tree
- 10 Bounding Tail Latency
- 11 Memory Requirement
- 12 Reducing Search Overhead
- 13 Reducing Compaction I/O Pink without level-pinning
- 14 Reducing Sorting Time
- 15 Custom KV-SSD Prototype and Setup All algorithms for KV-SSD were implemented on ZCU102 board
- 16 Experiment: Throughput
- 17 Experiment: Latency
- 18 Experiment: Impact of Level-pinning
- 19 Experiment: Search Optimization Settings Pink (NO-OPT): Pink without prefix and range pointer Benchmark: YCSB-Load and YCSB-C
