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