X-Git-Url: https://git.piment-noir.org/?a=blobdiff_plain;ds=sidebyside;f=README.md;h=9b1f81317b5a28e920789a096be724b14459f793;hb=b40ed51168059b59f6f5827def37f622be139ddb;hp=2adbd97daeb13ff2a2ea70ffb18f4532168989c4;hpb=168c526f6e6913506e56f7d5107335c3d3d42938;p=poolifier.git diff --git a/README.md b/README.md index 2adbd97d..9b1f8131 100644 --- a/README.md +++ b/README.md @@ -113,19 +113,22 @@ Instantiate your pool based on your needed : ```js 'use strict' -const { FixedThreadPool, DynamicThreadPool } = require('poolifier') +const { DynamicThreadPool, FixedThreadPool, PoolEvents } = require('poolifier') // a fixed worker-threads pool const pool = new FixedThreadPool(15, './yourWorker.js', { errorHandler: (e) => console.error(e), onlineHandler: () => console.log('worker is online') }) +pool.emitter.on(PoolEvents.busy, () => console.log('Pool is busy')) + // or a dynamic worker-threads pool const pool = new DynamicThreadPool(10, 100, './yourWorker.js', { errorHandler: (e) => console.error(e), onlineHandler: () => console.log('worker is online') }) -pool.emitter.on('busy', () => console.log('Pool is busy')) +pool.emitter.on(PoolEvents.full, () => console.log('Pool is full')) +pool.emitter.on(PoolEvents.busy, () => console.log('Pool is busy')) // the execute method signature is the same for both implementations, // so you can easy switch from one to another @@ -165,13 +168,28 @@ Node versions >= 16.x are supported. - `WorkerChoiceStrategies.ROUND_ROBIN`: Submit tasks to worker in a round robbin fashion - `WorkerChoiceStrategies.LESS_USED`: Submit tasks to the less used worker - `WorkerChoiceStrategies.LESS_BUSY`: Submit tasks to the less busy worker - - `WorkerChoiceStrategies.WEIGHTED_ROUND_ROBIN` Submit tasks to worker using a weighted round robin scheduling algorithm based on tasks execution time + - `WorkerChoiceStrategies.WEIGHTED_ROUND_ROBIN`: Submit tasks to worker using a weighted round robin scheduling algorithm based on tasks execution time - `WorkerChoiceStrategies.FAIR_SHARE`: Submit tasks to worker using a fair share tasks scheduling algorithm based on tasks execution time `WorkerChoiceStrategies.WEIGHTED_ROUND_ROBIN` and `WorkerChoiceStrategies.FAIR_SHARE` strategies are targeted to heavy and long tasks Default: `WorkerChoiceStrategies.ROUND_ROBIN` +- `workerChoiceStrategyOptions` (optional) - The worker choice strategy options object to use in this pool. + Properties: + + - `medRunTime` (optional) - Use the tasks median run time instead of the tasks average run time in worker choice strategies. + + Default: { medRunTime: false } + - `enableEvents` (optional) - Events emission enablement in this pool. Default: true +- `enableTasksQueue` (optional, experimental) - Tasks queue per worker enablement in this pool. Default: false + +- `tasksQueueOptions` (optional, experimental) - The worker tasks queue options object to use in this pool. + Properties: + + - `concurrency` (optional) - The maximum number of tasks that can be executed concurrently on a worker. + + Default: { concurrency: 1 } ### `pool = new DynamicThreadPool/DynamicClusterPool(min, max, filePath, opts)` @@ -249,7 +267,7 @@ But in general, **always profile your application** ## Contribute See guidelines [CONTRIBUTING](CONTRIBUTING.md) -Choose your task here [2.3.x](https://github.com/orgs/poolifier/projects/1), propose an idea, a fix, an improvement. +Choose your task here [2.4.x](https://github.com/orgs/poolifier/projects/1), propose an idea, a fix, an improvement. ## Team