“ You can change them, including by applying not only O(N), but also O(K) concurrency: 1. You can increase p by doing more of the same: Increase the volume of data processed by the parts that are O(N) parallelizable (and therefore the percentage p of time spent in computing). This is Gustafson’s Law. 2. You can increase p by doing more of something new: Add new features that are O(N) parallelizable. 3. You can reduce s by partially parallelizing it using O(K) techniques, such as pipelining.
