From 9309edc4865691a0fc35ba4ec84ba8333b9ebde8 Mon Sep 17 00:00:00 2001
From: sankarebarri <96892550+sankarebarri@users.noreply.github.com>
Date: Tue, 23 Dec 2025 19:02:11 +0000
Subject: [PATCH] =?UTF-8?q?Minor=20clarification=20suggestion=20for=20the?=
=?UTF-8?q?=20=E2=80=9CParallel=20Burgers=E2=80=9D=20analogy=20in=20concur?=
=?UTF-8?q?rency=20docs?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
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!
---
docs/en/docs/async.md | 7 +++++++
1 file changed, 7 insertions(+)
diff --git a/docs/en/docs/async.md b/docs/en/docs/async.md
index eac473bde4..1ad1b4a7a3 100644
--- a/docs/en/docs/async.md
+++ b/docs/en/docs/async.md
@@ -219,6 +219,13 @@ The fast food store has 8 processors (cashiers/cooks). While the concurrent burg
But still, the final experience is not the best. 😞
+/// note
+
+This example focuses on an I/O-bound scenario with significant waiting. Parallelism shines instead for CPU-bound work, where multiple workers actively perform computation at the same time.
+
+///
+
+
---
This would be the parallel equivalent story for burgers. 🍔