This is an automated email from the ASF dual-hosted git repository.
davidradl pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/flink.git
The following commit(s) were added to refs/heads/master by this push:
new 325e6344be0 [hotfix][docs] Fix inaccurate description of slot sharing
benefit (#28109)
325e6344be0 is described below
commit 325e6344be0650383667476639ee01898b55cfc5
Author: Huanglin Shen <[email protected]>
AuthorDate: Tue May 5 16:54:55 2026 +0800
[hotfix][docs] Fix inaccurate description of slot sharing benefit (#28109)
---
docs/content.zh/docs/concepts/flink-architecture.md | 2 +-
docs/content/docs/concepts/flink-architecture.md | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/docs/content.zh/docs/concepts/flink-architecture.md
b/docs/content.zh/docs/concepts/flink-architecture.md
index f1889501894..6d519b9a345 100644
--- a/docs/content.zh/docs/concepts/flink-architecture.md
+++ b/docs/content.zh/docs/concepts/flink-architecture.md
@@ -87,7 +87,7 @@ _JobManager_ 具有许多与协调 Flink 应用程序的分布式执行有关的
默认情况下，Flink 允许 subtask 共享 slot，即便它们是不同的 task 的 subtask，只要是来自于同一作业即可。结果就是一个
slot 可以持有整个作业管道。允许 *slot 共享*有两个主要优点：
- - Flink 集群所需的 task slot 和作业中使用的最大并行度恰好一样。无需计算程序总共包含多少个 task（具有不同并行度）。
+ - 一个 Flink 作业所需的 task slot 和该作业中使用的最大并行度恰好一样。无需计算程序总共包含多少个 task（具有不同并行度）。
- 容易获得更好的资源利用。如果没有 slot 共享，非密集 subtask（*source/map()*）将阻塞和密集型
subtask（*window*） 一样多的资源。通过 slot 共享，我们示例中的基本并行度从 2 增加到 6，可以充分利用分配的资源，同时确保繁重的
subtask 在 TaskManager 之间公平分配。
diff --git a/docs/content/docs/concepts/flink-architecture.md
b/docs/content/docs/concepts/flink-architecture.md
index 9531d0dfafd..5932e6755b2 100644
--- a/docs/content/docs/concepts/flink-architecture.md
+++ b/docs/content/docs/concepts/flink-architecture.md
@@ -143,7 +143,7 @@ different tasks, so long as they are from the same job. The
result is that one
slot may hold an entire pipeline of the job. Allowing this *slot sharing* has
two main benefits:
- - A Flink cluster needs exactly as many task slots as the highest parallelism
+ - A Flink job needs exactly as many task slots as the highest parallelism
used in the job. No need to calculate how many tasks (with varying
parallelism) a program contains in total.
