Hacker News new | past | comments | ask | show | jobs | submit login
An Overview of Kernel Lock Improvements [pdf]
94 points by mmastrac on Sept 1, 2014 | hide | past | favorite | 11 comments



Note: for those interested, MCS locks and qspinlocks are discussed in this fine article: http://lwn.net/Articles/590243/


This is great; I'm still reading through, but, I had no idea that the performance drop was that steep!


Do you mean the drop they later used to analyze cache line coherency when adding cores? They improved this if I understood the latter results correctly.


Can anyone explain the use of 'round-robin' to describe mulit-node scenarios and 'fill-first' for single node scenarios. I initially assumed they were describing thread schedulers, but that doesn't make clear sense in these tests. Thanks in advance.


This is the key: each locker spins on local memory rather than the lock word at page 63.


It would be interesting to see the same benchmarks for more normal amounts of cores. Most system does not have 240 cores, after all..


You can get 20core/40thread servers for $400/mo these days:

http://www.ovh.com/us/dedicated-servers/enterprise/2014-MG-2...

or 16core/32thread for $270

http://www.ovh.com/us/dedicated-servers/enterprise/2014-MG-1...

So double socket performance drop is a realistic concern.


The latest Intel hi-end desktop cpu has 8 cores. With hyper-threading; which makes 16 threads.

I think in the next 10 years we will reach a number that is close.


If you count Xeon Phi, Intel are already up to 61.

http://ark.intel.com/products/family/71840/Intel-Xeon-Phi-Co...


Most of these optimizations imply scaling by number of cores. Thus the more cores (and thus sockets/NUMA nodes), the more the benefit. Desktop-ish systems with ~4 cores don't see much gain, but nor did we introduce performance degradations.


great




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: