}
/** @inheritDoc */
- public choose (): number {
- return this.leastEluNextWorkerNodeKey()
+ public choose (): number | undefined {
+ this.setPreviousWorkerNodeKey(this.nextWorkerNodeKey)
+ this.nextWorkerNodeKey = this.leastEluNextWorkerNodeKey()
+ return this.nextWorkerNodeKey
}
/** @inheritDoc */
return true
}
- private leastEluNextWorkerNodeKey (): number {
- 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.isWorkerNodeReady(workerNodeKey) && workerElu === 0) {
- this.nextWorkerNodeKey = workerNodeKey
- break
- } else if (
- this.isWorkerNodeReady(workerNodeKey) &&
- workerElu < minWorkerElu
- ) {
- minWorkerElu = workerElu
- this.nextWorkerNodeKey = workerNodeKey
- }
- }
- return this.nextWorkerNodeKey
+ private leastEluNextWorkerNodeKey (): number | undefined {
+ return this.pool.workerNodes.reduce(
+ (minWorkerNodeKey, workerNode, workerNodeKey, workerNodes) => {
+ return this.isWorkerNodeReady(workerNodeKey) &&
+ (workerNode.usage.elu.active.aggregate ?? 0) <
+ (workerNodes[minWorkerNodeKey].usage.elu.active.aggregate ?? 0)
+ ? workerNodeKey
+ : minWorkerNodeKey
+ },
+ 0
+ )
}
}