News for hackers. Stuff that matters.
Re:Making the Tokio scheduler 10x faster by SloopJon on Monday October 14, 2019 @01:29PM (#21250657)
From a QA perspective, I feel like you buried the lede on this Loom tool. Benchmarks are nice, but confidence is an elusive thing when it comes to non-trivial concurrency.

I'll be spending some time on the CDSChecker and dynamic partial-order reduction papers.

Re:Making the Tokio scheduler 10x faster by carllerche on Monday October 14, 2019 @02:19PM (#21251203)
True... correctness is very important! I made mention of loom for correctness in the intro at least.

The goal for this article was primarily to focus on scheduler design.

I'm hoping to get posts dedicated to loom soon. It's been an indispensable tool.

Re:Making the Tokio scheduler 10x faster by snowAbstraction on Tuesday October 15, 2019 @02:48AM (#21256120)
Yes loom seems very important. I would interested to know how it compares with similar tools like nidhugg[1][2] for the C and C++.

[1] https://github.com/nidhugg/nidhugg [2] https://uu.diva-portal.org/smash/get/diva2:1324003/FULLTEXT0...

Re:Making the Tokio scheduler 10x faster by carllerche on Tuesday October 15, 2019 @10:56AM (#21259084)
I skimmed the paper and it looks similar to loom. Specifically they cite CHESS and Cdschecker as prior art. Both of those are what loom is based on.

I guess 2019 is the year of concurrency checking :-)