refactor: code cleanup
[poolifier.git] / benchmarks / benchmarks-utils.js
CommitLineData
ab7bb4f8
JB
1const crypto = require('node:crypto')
2const assert = require('node:assert')
3const fs = require('node:fs')
4const Benchmark = require('benchmark')
5const {
cdace0e5
JB
6 DynamicClusterPool,
7 DynamicThreadPool,
8 FixedClusterPool,
d9d8c14e 9 FixedThreadPool,
617848e3 10 Measurements,
d9d8c14e 11 PoolTypes,
cde5b54e 12 WorkerChoiceStrategies,
d9d8c14e 13 WorkerTypes
ab7bb4f8
JB
14} = require('../lib/index.js')
15const { TaskFunctions } = require('./benchmarks-types.js')
2d2e32c2 16
ab7bb4f8 17const buildPoolifierPool = (workerType, poolType, poolSize, poolOptions) => {
479ba9f6
JB
18 switch (poolType) {
19 case PoolTypes.fixed:
20 switch (workerType) {
21 case WorkerTypes.thread:
22 return new FixedThreadPool(
23 poolSize,
24 './benchmarks/internal/thread-worker.mjs',
25 poolOptions
26 )
27 case WorkerTypes.cluster:
28 return new FixedClusterPool(
29 poolSize,
ab7bb4f8 30 './benchmarks/internal/cluster-worker.js',
479ba9f6
JB
31 poolOptions
32 )
33 }
34 break
35 case PoolTypes.dynamic:
36 switch (workerType) {
37 case WorkerTypes.thread:
38 return new DynamicThreadPool(
39 Math.floor(poolSize / 2),
40 poolSize,
41 './benchmarks/internal/thread-worker.mjs',
42 poolOptions
43 )
44 case WorkerTypes.cluster:
45 return new DynamicClusterPool(
46 Math.floor(poolSize / 2),
47 poolSize,
ab7bb4f8 48 './benchmarks/internal/cluster-worker.js',
479ba9f6
JB
49 poolOptions
50 )
51 }
52 break
53 }
54}
55
ab7bb4f8 56const runPoolifierPool = async (pool, { taskExecutions, workerData }) => {
cde5b54e 57 return await new Promise((resolve, reject) => {
ff5e76e1 58 let executions = 0
cdace0e5 59 for (let i = 1; i <= taskExecutions; i++) {
ff5e76e1
JB
60 pool
61 .execute(workerData)
fe2f6f84 62 .then(() => {
0762fbb1 63 ++executions
cdace0e5 64 if (executions === taskExecutions) {
cde5b54e 65 resolve({ ok: 1 })
ff5e76e1
JB
66 }
67 return null
68 })
041dc05b 69 .catch(err => {
23ff945a 70 console.error(err)
cde5b54e 71 reject(err)
23ff945a 72 })
ff5e76e1
JB
73 }
74 })
75}
76
ab7bb4f8 77const runPoolifierPoolBenchmark = async (
cde5b54e
JB
78 name,
79 pool,
80 { taskExecutions, workerData }
81) => {
82 return await new Promise((resolve, reject) => {
83 try {
84 const suite = new Benchmark.Suite(name)
85 for (const workerChoiceStrategy of Object.values(
86 WorkerChoiceStrategies
87 )) {
88 for (const enableTasksQueue of [false, true]) {
617848e3
JB
89 if (workerChoiceStrategy === WorkerChoiceStrategies.FAIR_SHARE) {
90 for (const measurement of [
91 Measurements.runTime,
92 Measurements.elu
93 ]) {
94 suite.add(
405896a3 95 `${name} with ${workerChoiceStrategy}, with ${measurement} and ${
617848e3
JB
96 enableTasksQueue ? 'with' : 'without'
97 } tasks queue`,
98 async () => {
99 pool.setWorkerChoiceStrategy(workerChoiceStrategy, {
100 measurement
101 })
102 pool.enableTasksQueue(enableTasksQueue)
103 assert.strictEqual(
104 pool.opts.workerChoiceStrategy,
105 workerChoiceStrategy
106 )
107 assert.strictEqual(
108 pool.opts.enableTasksQueue,
109 enableTasksQueue
110 )
111 assert.strictEqual(
112 pool.opts.workerChoiceStrategyOptions.measurement,
113 measurement
114 )
115 await runPoolifierPool(pool, {
116 taskExecutions,
117 workerData
118 })
119 }
cde5b54e 120 )
cde5b54e 121 }
617848e3
JB
122 } else {
123 suite.add(
405896a3 124 `${name} with ${workerChoiceStrategy} and ${
617848e3
JB
125 enableTasksQueue ? 'with' : 'without'
126 } tasks queue`,
127 async () => {
128 pool.setWorkerChoiceStrategy(workerChoiceStrategy)
129 pool.enableTasksQueue(enableTasksQueue)
130 assert.strictEqual(
131 pool.opts.workerChoiceStrategy,
132 workerChoiceStrategy
133 )
134 assert.strictEqual(pool.opts.enableTasksQueue, enableTasksQueue)
135 await runPoolifierPool(pool, {
136 taskExecutions,
137 workerData
138 })
139 }
140 )
141 }
cde5b54e
JB
142 }
143 }
144 suite
145 .on('cycle', event => {
146 console.info(event.target.toString())
147 })
148 .on('complete', async function () {
149 console.info(
150 'Fastest is ' +
151 LIST_FORMATTER.format(this.filter('fastest').map('name'))
152 )
153 await pool.destroy()
154 resolve()
155 })
156 .run({ async: true })
157 } catch (error) {
158 reject(error)
159 }
160 })
a7825346
JB
161}
162
ab7bb4f8 163const LIST_FORMATTER = new Intl.ListFormat('en-US', {
f1c674cd
JB
164 style: 'long',
165 type: 'conjunction'
166})
167
ab7bb4f8 168const generateRandomInteger = (max = Number.MAX_SAFE_INTEGER, min = 0) => {
548140e6 169 if (max < min || max < 0 || min < 0) {
4af5c11a
JB
170 throw new RangeError('Invalid interval')
171 }
c2d7d79b 172 max = Math.floor(max)
4af5c11a 173 if (min != null && min !== 0) {
c2d7d79b 174 min = Math.ceil(min)
872585ea 175 return Math.floor(Math.random() * (max - min + 1)) + min
74750c7f 176 }
872585ea 177 return Math.floor(Math.random() * (max + 1))
74750c7f
JB
178}
179
041dc05b 180const jsonIntegerSerialization = n => {
cdace0e5
JB
181 for (let i = 0; i < n; i++) {
182 const o = {
183 a: i
184 }
185 JSON.stringify(o)
186 }
30b963d4 187 return { ok: 1 }
cdace0e5
JB
188}
189
bdacc2d2
JB
190/**
191 * Intentionally inefficient implementation.
7d82d90e
JB
192 * @param {number} n - The number of fibonacci numbers to generate.
193 * @returns {number} - The nth fibonacci number.
bdacc2d2 194 */
041dc05b 195const fibonacci = n => {
024daf59 196 if (n <= 1) return n
bdacc2d2
JB
197 return fibonacci(n - 1) + fibonacci(n - 2)
198}
199
7d82d90e
JB
200/**
201 * Intentionally inefficient implementation.
7d82d90e
JB
202 * @param {number} n - The number to calculate the factorial of.
203 * @returns {number} - The factorial of n.
204 */
041dc05b 205const factorial = n => {
7d82d90e
JB
206 if (n === 0) {
207 return 1
7d82d90e 208 }
965415bb 209 return factorial(n - 1) * n
7d82d90e
JB
210}
211
bac873bd 212const readWriteFiles = (
670734fc
JB
213 n,
214 baseDirectory = `/tmp/poolifier-benchmarks/${crypto.randomInt(
215 281474976710655
216 )}`
bac873bd 217) => {
670734fc
JB
218 if (fs.existsSync(baseDirectory) === true) {
219 fs.rmSync(baseDirectory, { recursive: true })
cdace0e5 220 }
670734fc 221 fs.mkdirSync(baseDirectory, { recursive: true })
cdace0e5
JB
222 for (let i = 0; i < n; i++) {
223 const filePath = `${baseDirectory}/${i}`
224 fs.writeFileSync(filePath, i.toString(), {
225 encoding: 'utf8',
226 flag: 'a'
227 })
228 fs.readFileSync(filePath, 'utf8')
229 }
670734fc 230 fs.rmSync(baseDirectory, { recursive: true })
30b963d4 231 return { ok: 1 }
cdace0e5
JB
232}
233
ab7bb4f8 234const executeTaskFunction = data => {
2d2e32c2 235 switch (data.function) {
dbca3be9 236 case TaskFunctions.jsonIntegerSerialization:
d1a9aa41 237 return jsonIntegerSerialization(data.taskSize || 1000)
dbca3be9 238 case TaskFunctions.fibonacci:
d1a9aa41 239 return fibonacci(data.taskSize || 1000)
dbca3be9 240 case TaskFunctions.factorial:
d1a9aa41 241 return factorial(data.taskSize || 1000)
dbca3be9 242 case TaskFunctions.readWriteFiles:
cdace0e5 243 return readWriteFiles(data.taskSize || 1000)
2d2e32c2 244 default:
dbca3be9 245 throw new Error('Unknown task function')
2d2e32c2
JB
246 }
247}
ab7bb4f8
JB
248
249module.exports = {
250 LIST_FORMATTER,
251 buildPoolifierPool,
252 executeTaskFunction,
253 generateRandomInteger,
254 runPoolifierPoolBenchmark
255}