From 3dba671e8b5f66e6598e3cc25a3472b27391e8ed Mon Sep 17 00:00:00 2001 From: =?utf8?q?J=C3=A9r=C3=B4me=20Benoit?= Date: Wed, 9 Aug 2023 22:44:03 +0200 Subject: [PATCH] docs: fix docs/worker-choice-strategies.md structure MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit Signed-off-by: Jérôme Benoit --- docs/worker-choice-strategies.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/worker-choice-strategies.md b/docs/worker-choice-strategies.md index 0a066279..147a500e 100644 --- a/docs/worker-choice-strategies.md +++ b/docs/worker-choice-strategies.md @@ -1,5 +1,7 @@ # Worker choice strategies +All duration or timestamp are expressed in milliseconds. + ## Table of contents - [Strategies](#strategies) @@ -11,8 +13,6 @@ ## Strategies -All duration or timestamp are expressed in milliseconds. - ### Fair share Its goal is to distribute the load evenly across all workers. To achieve this, the strategy keeps track of the average task execution time for each worker and assigns the next task to the worker with the lowest task end prediction time: `task_end_prediction = max(current_time, task_end_prediction) + average_task_execution_time`. -- 2.34.1