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