mirror of https://github.com/tiangolo/fastapi.git
9309edc486
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!
|
||
|---|---|---|
| .. | ||
| de | ||
| en | ||
| es | ||
| fr | ||
| ja | ||
| ko | ||
| pt | ||
| ru | ||
| tr | ||
| uk | ||
| zh | ||
| zh-hant | ||
| language_names.yml | ||
| missing-translation.md | ||