LSM trees optimize: write-heavy workloads by buffering writes in memory

B-trees optimize: disk-based sorted data with O(log n) reads per query

B-trees optimize disk-based sorted data with O(log n) reads per query

BFS vs DFS: BFS finds shortest path in unweighted graphs, DFS uses less memory

BFS finds shortest path in unweighted graphs; DFS uses less memory

Delay-line memory

CPU speed grows faster than memory speed

CPU cache

L1/L2 cache hierarchy reduces global memory latency

paged attention (vLLM) improves serving throughput

Paged attention (vLLM) improves serving throughput by reducing latency through non-contiguous KV-cache pages, enabling faster data retrieval

Load balancing (computing)

Load balancing distributes tasks efficiently across resources