-import { DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS } from '../../utils'
+import {
+ DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
+ DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS
+} from '../../utils'
import type { IPool } from '../pool'
import type { IWorker } from '../worker'
import { AbstractWorkerChoiceStrategy } from './abstract-worker-choice-strategy'
import type {
IWorkerChoiceStrategy,
- RequiredStatistics,
+ TaskStatisticsRequirements,
WorkerChoiceStrategyOptions
} from './selection-strategies-types'
* Selects the least busy worker.
*
* @typeParam Worker - Type of worker which manages the strategy.
- * @typeParam Data - Type of data sent to the worker. This can only be serializable data.
- * @typeParam Response - Type of execution response. This can only be serializable data.
+ * @typeParam Data - Type of data sent to the worker. This can only be structured-cloneable data.
+ * @typeParam Response - Type of execution response. This can only be structured-cloneable data.
*/
export class LeastBusyWorkerChoiceStrategy<
Worker extends IWorker,
extends AbstractWorkerChoiceStrategy<Worker, Data, Response>
implements IWorkerChoiceStrategy {
/** @inheritDoc */
- public readonly requiredStatistics: RequiredStatistics = {
- runTime: true,
- avgRunTime: false,
- medRunTime: false
+ public readonly taskStatisticsRequirements: TaskStatisticsRequirements = {
+ runTime: {
+ aggregate: true,
+ average: false,
+ median: false
+ },
+ waitTime: {
+ aggregate: true,
+ average: false,
+ median: false
+ },
+ elu: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS
}
/** @inheritDoc */
opts: WorkerChoiceStrategyOptions = DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS
) {
super(pool, opts)
- this.setRequiredStatistics(this.opts)
+ this.setTaskStatisticsRequirements(this.opts)
}
/** @inheritDoc */
/** @inheritDoc */
public choose (): number {
- const freeWorkerNodeKey = this.findFreeWorkerNodeKey()
- if (freeWorkerNodeKey !== -1) {
- return freeWorkerNodeKey
- }
- let minRunTime = Infinity
- let leastBusyWorkerNodeKey!: number
+ let minTime = Infinity
for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
- const workerRunTime = workerNode.tasksUsage.runTime
- if (workerRunTime === 0) {
- return workerNodeKey
- } else if (workerRunTime < minRunTime) {
- minRunTime = workerRunTime
- leastBusyWorkerNodeKey = workerNodeKey
+ const workerTime =
+ (workerNode.usage.runTime?.aggregate ?? 0) +
+ (workerNode.usage.waitTime?.aggregate ?? 0)
+ if (workerTime === 0) {
+ this.nextWorkerNodeId = workerNodeKey
+ break
+ } else if (workerTime < minTime) {
+ minTime = workerTime
+ this.nextWorkerNodeId = workerNodeKey
}
}
- return leastBusyWorkerNodeKey
+ return this.nextWorkerNodeId
}
/** @inheritDoc */