2 ms·
For all running threads, imagine that every operation can interleave in any possible way. Since the permutations grows in factorial time, the only way to manage
by dehrmann 6y ago
For all running threads, imagine that every operation can interleave in any possible way. Since the permutations grows in factorial time, the only way to manage concurrency is through well-defined interaction points with no more than a few interesting parts of execution. Are there only 4 possible sequences of significant instructions? Cool. Almost any more and it gets hard to reason about because there are so many paths that aren't obviously enumerable.