/** @inheritDoc */
public choose (): number {
+ return this.leastBusyNextWorkerNodeKey()
+ }
+
+ /** @inheritDoc */
+ public remove (): boolean {
+ return true
+ }
+
+ private leastBusyNextWorkerNodeKey (): number {
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 (workerTime === 0) {
- this.nextWorkerNodeId = workerNodeKey
+ if (this.isWorkerNodeReady(workerNodeKey) && workerTime === 0) {
+ this.nextWorkerNodeKey = workerNodeKey
break
- } else if (workerTime < minTime) {
+ } else if (
+ this.isWorkerNodeReady(workerNodeKey) &&
+ workerTime < minTime
+ ) {
minTime = workerTime
- this.nextWorkerNodeId = workerNodeKey
+ this.nextWorkerNodeKey = workerNodeKey
}
}
- return this.nextWorkerNodeId
- }
-
- /** @inheritDoc */
- public remove (): boolean {
- return true
+ return this.nextWorkerNodeKey
}
}