-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'
* Selects the worker with the least ELU.
*
* @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 LeastEluWorkerChoiceStrategy<
Worker extends IWorker,
implements IWorkerChoiceStrategy {
/** @inheritDoc */
public readonly taskStatisticsRequirements: TaskStatisticsRequirements = {
- runTime: false,
- avgRunTime: false,
- medRunTime: false,
- waitTime: false,
- avgWaitTime: false,
- medWaitTime: false,
- elu: true
+ runTime: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
+ waitTime: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
+ elu: {
+ aggregate: true,
+ average: false,
+ median: false
+ }
}
/** @inheritDoc */
opts: WorkerChoiceStrategyOptions = DEFAULT_WORKER_CHOICE_STRATEGY_OPTIONS
) {
super(pool, opts)
- this.setTaskStatistics(this.opts)
+ this.setTaskStatisticsRequirements(this.opts)
}
/** @inheritDoc */
/** @inheritDoc */
public choose (): number {
- let minWorkerElu = Infinity
- let leastEluWorkerNodeKey!: number
- for (const [workerNodeKey, workerNode] of this.pool.workerNodes.entries()) {
- const workerUsage = workerNode.workerUsage
- const workerElu = workerUsage.elu?.utilization ?? 0
- if (workerElu === 0) {
- return workerNodeKey
- } else if (workerElu < minWorkerElu) {
- minWorkerElu = workerElu
- leastEluWorkerNodeKey = workerNodeKey
- }
- }
- return leastEluWorkerNodeKey
+ return this.leastEluNextWorkerNodeKey()
}
/** @inheritDoc */
public remove (): boolean {
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
+ }
}