}
/** @inheritDoc */
- public choose (): number {
- this.leastEluNextWorkerNodeKey()
+ public choose (): number | undefined {
+ this.nextWorkerNodeKey = this.leastEluNextWorkerNodeKey()
return this.nextWorkerNodeKey
}
return true
}
- private leastEluNextWorkerNodeKey (): void {
+ 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 (this.isWorkerNodeReady(workerNodeKey) && workerElu === 0) {
- this.nextWorkerNodeKey = workerNodeKey
+ if (workerElu === 0) {
+ chosenWorkerNodeKey = workerNodeKey
break
- } else if (
- this.isWorkerNodeReady(workerNodeKey) &&
- workerElu < minWorkerElu
- ) {
+ } else if (workerElu < minWorkerElu) {
minWorkerElu = workerElu
- this.nextWorkerNodeKey = workerNodeKey
+ chosenWorkerNodeKey = workerNodeKey
}
}
+ return chosenWorkerNodeKey
}
}