GRU vs LSTM: GRU uses 2 gates and is faster, LSTM uses 3 gates and captures longer dependencies

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

Triton differs from CUDA

Why does a super-fast computer sometimes run slower than a regular one?

CPU cache

L1/L2 cache hierarchy reduces global memory latency

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

LSM trees buffer writes in memory for write-heavy workloads

Greedy vs dynamic programming: greedy makes locally optimal choices, DP considers all subproblems

Greedy: locally optimal choices; DP: considers all subproblems

tl.load and tl.store do in Triton: read/write tensors from/to GPU global memory

`tl.load` reads tensors from GPU memory; `tl.store` writes tensors to GPU memory