Differences

This shows you the differences between two versions of the page.

--- adrianchadd:lockingalgorithmstuff [2009/05/12 07:22] – AdrianChadd
+++ adrianchadd:lockingalgorithmstuff [2022/06/10 02:43] (current) – Use link text for links KubilayKocak
@@ Line 1: / Line 1: @@
 This is a simple placeholder page for now containing links to papers, slides, books, etc on various methods of SMP friendly algorithm implementations.
-  * Practical Lock Freedom; Fraser. K. (2004) - http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-579.pdf
+  * [[http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-579.pdf|Practical Lock Freedom; Fraser. K. (2004) (PDF)]]
-  * Efficient Locking for Concurrent Operations on B-Trees; Lehman. P. L., Yao. (1981) - http://portal.acm.org/citation.cfm?id=319663&dl=GUIDE&coll=GUIDE&CFID=61777986&CFTOKEN=74351190
+  * [[http://portal.acm.org/citation.cfm?id=319663&dl=GUIDE&coll=GUIDE&CFID=61777986&CFTOKEN=74351190|Efficient Locking for Concurrent Operations on B-Trees; Lehman. P. L., Yao. (1981)]]
-  * (Java) A Lock-Free Hash Table; Click. C. (2007) - http://www.azulsystems.com/events/javaone_2007/2007_LockFreeHash.pdf
+  * [[http://www.azulsystems.com/events/javaone_2007/2007_LockFreeHash.pdf|(Java) A Lock-Free Hash Table; Click. C. (2007) (PDF)]]
+  * [[http://www.kernel.org/pub/linux/kernel/people/npiggin/patches/lockless/2.6.16-rc5/radix-intro.pdf|(Linux) Lockless Radix Tree (PDF)]]
+  * [[http://conferences.sigcomm.org/sigcomm/1997/papers/p192.pdf|Small Forwarding Tables for Fast Routing Lookups; Degermark. M., Brodnik. A., Carlsson. S., Pink. S. (1997) - (SIGCOMM 1997) (PDF)]]
+  * [[http://www.cs.toronto.edu/~tomhart/papers/hart_ipdps06.pdf|Make Lockless Synchronization Fast: Performance Implications of Memory Reclamation; Hart. E., !McKenney. P. E., Brown. A. D. (2006) (PDF)]]