Skip to content

RFC Priority Sifting Reader-Writer Lock v13

Mathieu Desnoyers lkml 1 version New

Get series with b4
b4 am [email protected]

Versions newest first

  1. v1 RFC Latest5 patches 0 repliesNew

Patches in v1 No applies recorded yet

#Subject and filesSizeRepliesApplied
1/5Priority Sifting Reader-Writer Lock v13include/linux/psrwlock-types.h include/linux/psrwlock.h lib/Kconfig.debug +2 more+1321 -00 replies
2/5Priority Sifting Reader-Writer Lock DocumentationDocumentation/psrwlock.txt+440 -00 replies
3/5Priority Sifting Reader-Writer Lock x86_64 Optimised Callarch/x86/Kconfig arch/x86/kernel/Makefile arch/x86/kernel/call_64.S +2 more+153 -00 replies
4/5Priority Sifting Reader-Writer Lock Samplesamples/Kconfig samples/Makefile samples/psrwlock/Makefile +1 more+183 -10 replies
5/5Priority Sifting Reader-Writer Lock Latency Traceinclude/linux/psrwlock-latency-trace.h lib/Kconfig.debug lib/psrwlock-latency-trace.c+396 -00 replies

Reviews trailers per patch

No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.

Read the v1 thread

Cover letter [RFC PATCH 0/5] Priority Sifting Reader-Writer Lock v13

Hi,

Here is the reworked version of what was initially called "Fair rwlock", then "writer-biased rwlock". Hopefully the naming should now better represent the innovation in this reader-writer locking scheme.

Thanks to Linus' patient explanations, it uses a single atomic op on a 32 bit variable in the fast path. The bright side of this is instruction-wise compactness of the fast path and that there is practically no limitation on the number of readers or writers. The downside is added memory ordering complexity between fast and slow path variables in the slow path.

Mathieu

Signature · 3 lines
Mathieu Desnoyers
Computer Engineering Ph.D. Student, Ecole Polytechnique de Montreal
OpenPGP key fingerprint: 8CD5 52C3 8E3C 4140 715F  BA06 3F25 A8FE 3BAE 9A68