@ThePrimeagen This way you have batching, much less memory overhead, and you don't need the WASM bindings.
Also the wasm worker can maintain its own vdom, to minimize changes.
@ThePrimeagen Wasm will compute the desired DOM changes, and then store them in the array buffer and signal the main thread.
The main thread will apply the changes and save the operations result in the main buffer, and signal wasm once done.
2/3
@matteocollina@rakyll becuase AWS is a huge company, and very slow. When they release software they need to support millions of customers. Google on the other hand has been working on it for several years (from the launch of kubernetes).
@phil_eaton I would say bitcode allows for easier implementation of big int, big decimal and makes it easier to support exotic architectures, like GPU/TPUs have usually bigger word size.
@rhein_wein is 40k is reasonable amount? Seems a bit much to me. The real cost maybe is the salary of the new employee, which will most probably be higher than the fired one.
Hey @axboe it seems my example is becoming very popular, and many people contacted me for questions and more examples. I will try to collect tips and best practices in a tutorial but I see there's a lot of stuff to investigate :) Some questions to start:
1/2
- Can I use fixed buffers with recv? Or is it better to use read with sockets?
- Does io_uring do any batching behind the scene? Maybe with SQPOLL can I expect requests to be batched?
- What do you think it's more important, fixed buffers or batching?
2/2
After 4 months of hard work, I made an NVMe io_uring example work. So hard, but so happy that I made it. I feel like I improved a lot. Thanks to @axboe for building io_uring and Ankit Kumar for helping me.
https://t.co/pQ03hv69UW #io_uring