/** @inheritDoc */
public choose (): number | undefined {
+ this.setPreviousWorkerNodeKey(this.nextWorkerNodeKey)
this.nextWorkerNodeKey = this.leastEluNextWorkerNodeKey()
return this.nextWorkerNodeKey
}
}
private leastEluNextWorkerNodeKey (): number | undefined {
- let minWorkerElu = Infinity
- let chosenWorkerNodeKey: number | undefined
- for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
- if (!this.isWorkerNodeEligible(workerNodeKey)) {
- continue
- }
- const workerUsage = workerNode.usage
- const workerElu = workerUsage.elu?.active?.aggregate ?? 0
- if (workerElu === 0) {
- chosenWorkerNodeKey = workerNodeKey
- break
- } else if (workerElu < minWorkerElu) {
- minWorkerElu = workerElu
- chosenWorkerNodeKey = workerNodeKey
- }
- }
- return chosenWorkerNodeKey
+ return this.pool.workerNodes.reduce(
+ (minWorkerNodeKey, workerNode, workerNodeKey, workerNodes) => {
+ return (workerNode.usage.elu.active.aggregate ?? 0) <
+ (workerNodes[minWorkerNodeKey].usage.elu.active.aggregate ?? 0)
+ ? workerNodeKey
+ : minWorkerNodeKey
+ },
+ 0
+ )
}
}