This is an old revision of the document!
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
- 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
- (Java) A Lock-Free Hash Table; Click. C. (2007) - http://www.azulsystems.com/events/javaone_2007/2007_LockFreeHash.pdf
- (Linux) Lockless Radix Tree; - http://www.kernel.org/pub/linux/kernel/people/npiggin/patches/lockless/2.6.16-rc5/radix-intro.pdf
- Small Forwarding Tables for Fast Routing Lookups; Degermark. M., Brodnik. A., Carlsson. S., Pink. S. (1997) - (SIGCOMM 1997) - http://conferences.sigcomm.org/sigcomm/1997/papers/p192.pdf
- Make Lockless Synchronization Fast: Performance Implications of Memory Reclimation; Hart. E., McKenney. P. E., Brown. A. D. (2006) - http://www.cs.toronto.edu/~tomhart/papers/hart_ipdps06.pdf