repositories
/
poolifier.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Merge branch 'master' of github.com:poolifier/poolifier
[poolifier.git]
/
src
/
pools
/
selection-strategies
/
least-elu-worker-choice-strategy.ts
diff --git
a/src/pools/selection-strategies/least-elu-worker-choice-strategy.ts
b/src/pools/selection-strategies/least-elu-worker-choice-strategy.ts
index 7c837ceff3d7b7ca45a5bd9da29feaa70784ef0c..4cf2b3e43253fb1221652f5265fbc958841ff561 100644
(file)
--- a/
src/pools/selection-strategies/least-elu-worker-choice-strategy.ts
+++ b/
src/pools/selection-strategies/least-elu-worker-choice-strategy.ts
@@
-7,6
+7,7
@@
import type { IWorker } from '../worker'
import { AbstractWorkerChoiceStrategy } from './abstract-worker-choice-strategy'
import type {
IWorkerChoiceStrategy,
import { AbstractWorkerChoiceStrategy } from './abstract-worker-choice-strategy'
import type {
IWorkerChoiceStrategy,
+ StrategyPolicy,
TaskStatisticsRequirements,
WorkerChoiceStrategyOptions
} from './selection-strategies-types'
TaskStatisticsRequirements,
WorkerChoiceStrategyOptions
} from './selection-strategies-types'
@@
-25,6
+26,12
@@
export class LeastEluWorkerChoiceStrategy<
>
extends AbstractWorkerChoiceStrategy<Worker, Data, Response>
implements IWorkerChoiceStrategy {
>
extends AbstractWorkerChoiceStrategy<Worker, Data, Response>
implements IWorkerChoiceStrategy {
+ /** @inheritDoc */
+ public readonly strategyPolicy: StrategyPolicy = {
+ dynamicWorkerUsage: false,
+ dynamicWorkerReady: true
+ }
+
/** @inheritDoc */
public readonly taskStatisticsRequirements: TaskStatisticsRequirements = {
runTime: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
/** @inheritDoc */
public readonly taskStatisticsRequirements: TaskStatisticsRequirements = {
runTime: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
@@
-56,8
+63,10
@@
export class LeastEluWorkerChoiceStrategy<
}
/** @inheritDoc */
}
/** @inheritDoc */
- public choose (): number {
- return this.leastEluNextWorkerNodeKey()
+ public choose (): number | undefined {
+ const chosenWorkerNodeKey = this.leastEluNextWorkerNodeKey()
+ this.assignChosenWorkerNodeKey(chosenWorkerNodeKey)
+ return this.nextWorkerNodeKey
}
/** @inheritDoc */
}
/** @inheritDoc */
@@
-65,22
+74,23
@@
export class LeastEluWorkerChoiceStrategy<
return true
}
return true
}
- private leastEluNextWorkerNodeKey (): number {
+ private leastEluNextWorkerNodeKey (): number
| undefined
{
let minWorkerElu = Infinity
let minWorkerElu = Infinity
+ let chosenWorkerNodeKey: number | undefined
for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
const workerUsage = workerNode.usage
const workerElu = workerUsage.elu?.active?.aggregate ?? 0
for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
const workerUsage = workerNode.usage
const workerElu = workerUsage.elu?.active?.aggregate ?? 0
- if (this.isWorkerNode
Ready
(workerNodeKey) && workerElu === 0) {
-
this.next
WorkerNodeKey = workerNodeKey
+ if (this.isWorkerNode
Eligible
(workerNodeKey) && workerElu === 0) {
+
chosen
WorkerNodeKey = workerNodeKey
break
} else if (
break
} else if (
- this.isWorkerNode
Ready
(workerNodeKey) &&
+ this.isWorkerNode
Eligible
(workerNodeKey) &&
workerElu < minWorkerElu
) {
minWorkerElu = workerElu
workerElu < minWorkerElu
) {
minWorkerElu = workerElu
-
this.next
WorkerNodeKey = workerNodeKey
+
chosen
WorkerNodeKey = workerNodeKey
}
}
}
}
- return
this.next
WorkerNodeKey
+ return
chosen
WorkerNodeKey
}
}
}
}