File tree Expand file tree Collapse file tree 1 file changed +7
-6
lines changed Expand file tree Collapse file tree 1 file changed +7
-6
lines changed Original file line number Diff line number Diff line change 31
31
/*
32
32
* The basic principle of a queue-based spinlock can best be understood
33
33
* by studying a classic queue-based spinlock implementation called the
34
- * MCS lock. The paper below provides a good description for this kind
35
- * of lock.
34
+ * MCS lock. A copy of the original MCS lock paper ("Algorithms for Scalable
35
+ * Synchronization on Shared-Memory Multiprocessors by Mellor-Crummey and
36
+ * Scott") is available at
36
37
*
37
- * http ://www.cise.ufl.edu/tr/DOC/REP-1992-71.pdf
38
+ * https ://bugzilla.kernel.org/show_bug.cgi?id=206115
38
39
*
39
- * This queued spinlock implementation is based on the MCS lock, however to make
40
- * it fit the 4 bytes we assume spinlock_t to be, and preserve its existing
41
- * API, we must modify it somehow.
40
+ * This queued spinlock implementation is based on the MCS lock, however to
41
+ * make it fit the 4 bytes we assume spinlock_t to be, and preserve its
42
+ * existing API, we must modify it somehow.
42
43
*
43
44
* In particular; where the traditional MCS lock consists of a tail pointer
44
45
* (8 bytes) and needs the next pointer (another 8 bytes) of its own node to
You can’t perform that action at this time.
0 commit comments