
Bishop's Law: Work done in async requires a resync. As the work complexity increases, so does the resync complexity. Resync complexity: R = αC + β (for independent streams/parallelism) R = αC² + β (for conflicting streams/concurrency), Where C is total async work complexity, α is the scaling factor, and β is fixed overhead.












