Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
| adrianchadd:lockingalgorithmstuff [2009/05/15 07:05] – 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. | 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:// | + | * [[http:// |
| - | * Efficient Locking for Concurrent Operations on B-Trees; Lehman. P. L., Yao. (1981) - http:// | + | * [[http:// |
| - | * (Java) A Lock-Free Hash Table; Click. C. (2007) - http:// | + | * [[http:// |
| - | * (Linux) Lockless Radix Tree; - http:// | + | * [[http:// |
| - | * Small Forwarding Tables for Fast Routing Lookups; Degermark. M., Brodnik. A., Carlsson. S., Pink. S. (1997) - (SIGCOMM 1997) - http://conferences.sigcomm.org/sigcomm/ | + | * [[http:// |
| + | * [[http://www.cs.toronto.edu/~tomhart/papers/hart_ipdps06.pdf|Make Lockless Synchronization Fast: Performance Implications of Memory Reclamation; | ||