Old Drepper paper on M:N vs 1:1 in Linux. NGPT is M:N, NPTL is 1:1. 1:1 threads beat M:N in every case. https://akkadia.org/drepper/nptl-design.pdf …
-
-
Chrome’s concurrency model is the easiest I’ve ever worked in. It’s basically tasks on a thread pool, except tasks can be grouped into sequences. The tasks in a sequence can be run on different threads, but always in the order they were posted to the sequence.
-
That’s similar to mio in Rust, which is a model I’m in favor of for async stuff :)
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.