Minor clarification suggestion for the “Parallel Burgers” analogy in … #14594
+7
−0
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
…concurrency docs
Hi 👋
The burgers analogy is one of the clearest explanations of async/concurrency I’ve seen.
I wanted to raise a small pedagogical point regarding the “Parallel Burgers” section.
While the analogy does highlight why parallelism is not ideal for I/O-bound workloads, it may unintentionally give readers the impression that parallelism itself is inefficient or inherently worse than concurrency, rather than simply better suited for CPU-bound work.
In particular, the example emphasises waiting and idle time, whereas true parallelism is most beneficial when multiple workers are actively doing computation simultaneously.
A small clarification (or an alternative example where multiple cooks actively work on different parts of the task at the same time) might help reinforce that distinction.
This is a minor point, but I thought it could help avoid confusion for readers learning these concepts for the first time.
Thanks again for the great docs!