Linux Scalability Effort Homepage - Locking
Ottawa Linux Symposium 2002 dcache paper and slides
Scalability of the Directory Entry Cache Paper Paper
Presentation slides of the paper Presentation Slides
Fast-Walking lockstat results running dbench with 16 clients on 8-way
Fast Walk Patch on 2.5.5-dj2:
lockstat results for 255-dj2 clean .
lockstat results for 255-dj2 patched with
lockstat results for 2.4.17 clean .
lockstat results for 2.4.17 patched with fast-walk
Lockmeter results on 2.4.17, 2.5.3, 2.5.5 running dbench 16 on 8-way
lockmeter results for 2.4.17 clean .
lockmeter results for 2.5.3 clean .
lockmeter results for 2.5.5 clean .
lockmeter results with Al Viro's priority change on 2.5.5 .
Read-Copy Update Mutual Exclusion
Read-Copy Update is
a Two-phase Update Method for Mutual Exclusion in Linux
that allows avoiding of the overheads of spin-waiting locks.
Data Dependency and wmb()
Some CPUs don't support synchronous invalidation in hardware. Some
to work around this.
We currently recommend the use of the lockmeter tool to measure
lock hold times. More information can be found
Last updated: 01/10/01 Any problems, additions, etc , please
send email to the Webmeistern.