Parallel programming is hard. Right?
This article claims the real difficulty in parallel programming is choosing the correct granularity at which to decompose the problem. I’d like to think we can decompose problems in a maximally parallel way, and let the runtime figure out where to avoid actual parallelism.
Worth reading the counterpoint in the comments from Jonathan May.