-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: {
- aggregate: false,
+ runTime: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
+ waitTime: DEFAULT_MEASUREMENT_STATISTICS_REQUIREMENTS,
+ elu: {
+ aggregate: true,
average: false,
median: false
- },
- waitTime: {
- aggregate: false,
- average: false,
- median: false
- },
- elu: true
+ }
}
/** @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
+ public choose (): number | undefined {
+ this.setPreviousWorkerNodeKey(this.nextWorkerNodeKey)
+ this.nextWorkerNodeKey = this.leastEluNextWorkerNodeKey()
+ return this.nextWorkerNodeKey
}
/** @inheritDoc */
public remove (): boolean {
return true
}
+
+ private leastEluNextWorkerNodeKey (): number | undefined {
+ return this.pool.workerNodes.reduce(
+ (minWorkerNodeKey, workerNode, workerNodeKey, workerNodes) => {
+ return (workerNode.usage.elu.active.aggregate ?? 0) <
+ (workerNodes[minWorkerNodeKey].usage.elu.active.aggregate ?? 0)
+ ? workerNodeKey
+ : minWorkerNodeKey
+ },
+ 0
+ )
+ }
}