From: Jérôme Benoit Date: Sat, 19 Aug 2023 20:35:03 +0000 (+0200) Subject: feat: remove the experimental status of LEAST_ELU WCS X-Git-Tag: v2.6.31~12 X-Git-Url: https://git.piment-noir.org/?a=commitdiff_plain;h=a71b05bcb245f8c141aabb8fbb7eba27758f65f1;p=poolifier.git feat: remove the experimental status of LEAST_ELU WCS Signed-off-by: Jérôme Benoit --- diff --git a/CHANGELOG.md b/CHANGELOG.md index 2fcf3b22..ec60d67a 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -14,6 +14,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0 ### Changed - Make orthogonal worker choice strategies tasks distribution and dynamic worker creation usage. +- Remove the experimental status of the `LEAST_ELU` worker choice strategy. ## [2.6.30] - 2023-08-19 diff --git a/docs/api.md b/docs/api.md index 1848c130..62d694b6 100644 --- a/docs/api.md +++ b/docs/api.md @@ -63,7 +63,7 @@ An object with these properties: - `WorkerChoiceStrategies.ROUND_ROBIN`: Submit tasks to worker in a round robin fashion - `WorkerChoiceStrategies.LEAST_USED`: Submit tasks to the worker with the minimum number of executed, executing and queued tasks - `WorkerChoiceStrategies.LEAST_BUSY`: Submit tasks to the worker with the minimum tasks total execution and wait time - - `WorkerChoiceStrategies.LEAST_ELU`: Submit tasks to the worker with the minimum event loop utilization (ELU) (experimental) + - `WorkerChoiceStrategies.LEAST_ELU`: Submit tasks to the worker with the minimum event loop utilization (ELU) - `WorkerChoiceStrategies.WEIGHTED_ROUND_ROBIN`: Submit tasks to worker by using a [weighted round robin scheduling algorithm](./../docs/worker-choice-strategies.md#weighted-round-robin) based on tasks execution time - `WorkerChoiceStrategies.INTERLEAVED_WEIGHTED_ROUND_ROBIN`: Submit tasks to worker by using an [interleaved weighted round robin scheduling algorithm](./../docs/worker-choice-strategies.md#interleaved-weighted-round-robin) based on tasks execution time (experimental) - `WorkerChoiceStrategies.FAIR_SHARE`: Submit tasks to worker by using a [fair share scheduling algorithm](./../docs/worker-choice-strategies.md#fair-share) based on tasks execution time (the default) or ELU active time diff --git a/src/pools/selection-strategies/selection-strategies-types.ts b/src/pools/selection-strategies/selection-strategies-types.ts index 4377624e..6a6dfe72 100644 --- a/src/pools/selection-strategies/selection-strategies-types.ts +++ b/src/pools/selection-strategies/selection-strategies-types.ts @@ -16,8 +16,6 @@ export const WorkerChoiceStrategies = Object.freeze({ LEAST_BUSY: 'LEAST_BUSY', /** * Least ELU worker selection strategy. - * - * @experimental */ LEAST_ELU: 'LEAST_ELU', /**