Just something as simple as setting up a threadpool adds up timewise if you do it in serial. It can easily be that making it faster adds up use cases where proc

Just something as simple as setting up a threadpool adds up timewise if you do it in serial. It can easily be that making it faster adds up use cases where processes are not possible today because they would be too slow to set up compared to the alternatives. What I missed from the presentation is some discussion about the asyncronicity of the clone calls. Yes, the average time of cloning once is 30us, but if you queue up two of them at once, how long does that take? Will it just sum or will the total time be shorter? Today there are applications that set up a thread pool by recursively open new threads, both in the original thread and in the forked ones. That is more than a little bit icky and could perhaps be simplified with this.