Fun with text generation pt. 1: markov models in awk
Inspired by Really fast Markov chains in ~20 lines of sh, grep, cut and awk this series is intended to explore text generation, first with markov models, then with generative adversarial networks.
I’m not sure this is right. Random access busts caches (slowing reads), and more generally linear access is more capable of being optimized by preloading. This effect is even greater when data are spread across different network nodes (because network IO is relatively slow and relatively easy to saturate).