Table of Contents 1Optimizing Compute Bound Code: Random Minimizers1.1Avoiding Branch Misses 1.2SIMD: Processing In Parallel 1.3Instruction Level Parallelism 1.4Input Format 2Optimizing Memory Bound Code: Minimal Perfect Hashing2.1Using Less Memory 2.2Reducing Memory Accesses 2.3Interleaving Memory Accesses 2.4Batching, Streaming, and Prefetching 3TODO Writing High Performance Code3.1TODO Benchmarking 3.2Writing and Optimizing High Performance Code 3.3DROP? Performance Metrics Attribution Thi...
