なるべく同時実行されないようにrandomにdelayさせる

times.js

const tries = 10000;
const trial = 30;

// in ms
const consumption = 30;
const concurrency = 3;

//const delay = 19185; // 50%ぐらい in 20 conc
//const delay = 4000; // 50%ぐらい in  10 conc
//const delay = 10000; // 5%ぐらい in  5 conc
//const delay = 1500; // 11%ぐらい in  3 conc
const delay = 500; // 30%ぐらい in  3 conc

const overlap = (delay1, delay2) => delay1 < delay2 + consumption && delay2 < delay1 + consumption;
const hoge = () => {
  const times = new Array(concurrency).fill(null).map(() => Math.random() * delay);
  return times.every((t1, i) => (times.every((t2, j) => i === j || !overlap(t1,t2))));
};
const avg = nums => {
  const sum = nums.reduce((x, y) => x + y);
  return sum / nums.length;
};

console.log(avg(new Array(trial).fill(null).map(() => 
    new Array(tries).fill(null).map(() => hoge()).filter(x => x).length / (tries * 1.0)
    )// 正規分布になる。平均が中央値。
   ));