If there is no free isolate, current implementation simply uses the first busy one it finds. This can cause a isolate to be flooded with tasks while others are free.
The algorithm has been replaced. Now it selects the isolate that has less tasks in its queue. I'll open another issue proposing Task weight, making possible a smarter algorithm.
If there is no free isolate, current implementation simply uses the first busy one it finds. This can cause a isolate to be flooded with tasks while others are free.