/** @inheritDoc */
public choose (): number | undefined {
- const chosenWorkerNodeKey = this.leastUsedNextWorkerNodeKey()
- this.assignChosenWorkerNodeKey(chosenWorkerNodeKey)
+ this.setPreviousWorkerNodeKey(this.nextWorkerNodeKey)
+ this.nextWorkerNodeKey = this.leastUsedNextWorkerNodeKey()
return this.nextWorkerNodeKey
}
}
private leastUsedNextWorkerNodeKey (): number | undefined {
- let minNumberOfTasks = Infinity
- let chosenWorkerNodeKey: number | undefined
- for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
- const workerTaskStatistics = workerNode.usage.tasks
- const workerTasks =
- workerTaskStatistics.executed +
- workerTaskStatistics.executing +
- workerTaskStatistics.queued
- if (this.isWorkerNodeEligible(workerNodeKey) && workerTasks === 0) {
- chosenWorkerNodeKey = workerNodeKey
- break
- } else if (
- this.isWorkerNodeEligible(workerNodeKey) &&
- workerTasks < minNumberOfTasks
- ) {
- minNumberOfTasks = workerTasks
- chosenWorkerNodeKey = workerNodeKey
- }
- }
- return chosenWorkerNodeKey
+ return this.pool.workerNodes.reduce(
+ (minWorkerNodeKey, workerNode, workerNodeKey, workerNodes) => {
+ return this.isWorkerNodeReady(workerNodeKey) &&
+ workerNode.usage.tasks.executed +
+ workerNode.usage.tasks.executing +
+ workerNode.usage.tasks.queued <
+ workerNodes[minWorkerNodeKey].usage.tasks.executed +
+ workerNodes[minWorkerNodeKey].usage.tasks.executing +
+ workerNodes[minWorkerNodeKey].usage.tasks.queued
+ ? workerNodeKey
+ : minWorkerNodeKey
+ },
+ 0
+ )
}
}