}
/** @inheritDoc */
- public choose (): number {
- this.leastBusyNextWorkerNodeKey()
+ public choose (): number | undefined {
+ this.setPreviousWorkerNodeKey(this.nextWorkerNodeKey)
+ this.nextWorkerNodeKey = this.leastBusyNextWorkerNodeKey()
return this.nextWorkerNodeKey
}
return true
}
- private leastBusyNextWorkerNodeKey (): void {
- let minTime = Infinity
- for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
- const workerTime =
- (workerNode.usage.runTime?.aggregate ?? 0) +
- (workerNode.usage.waitTime?.aggregate ?? 0)
- if (this.isWorkerNodeReady(workerNodeKey) && workerTime === 0) {
- this.nextWorkerNodeKey = workerNodeKey
- break
- } else if (
- this.isWorkerNodeReady(workerNodeKey) &&
- workerTime < minTime
- ) {
- minTime = workerTime
- this.nextWorkerNodeKey = workerNodeKey
- }
- }
+ private leastBusyNextWorkerNodeKey (): number | undefined {
+ return this.pool.workerNodes.reduce(
+ (minWorkerNodeKey, workerNode, workerNodeKey, workerNodes) => {
+ return (workerNode.usage.runTime.aggregate ?? 0) +
+ (workerNode.usage.waitTime.aggregate ?? 0) <
+ (workerNodes[minWorkerNodeKey].usage.runTime.aggregate ?? 0) +
+ (workerNodes[minWorkerNodeKey].usage.waitTime.aggregate ?? 0)
+ ? workerNodeKey
+ : minWorkerNodeKey
+ },
+ 0
+ )
}
}