The first of these laws is about the influence of serialized access on the mean response time (or latency), and thereby on throughput. Despite the fact that we may always want to parallelize our work, there may come a point where it cannot be parallelized and we are required to serialize work instead. This might be the case if we have a coordinator worker, or an aggregation or reduction operator in the reactive flow, meaning we have to join all executions. Alternatively, it may be a piece of code that works only in serial mode, so it cannot be executed in parallel. In large microservice systems, this might be the load balancer or orchestration system. Therefore, we can refer to Amdahl's Law in order to calculate the throughput ...
Amdahl's Law
Get Hands-On Reactive Programming in Spring 5 now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.