Check out my first novel, midnight's simulacra!
Lock-free algorithms: Difference between revisions
From dankwiki
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
* LWN's [http://lwn.net/Articles/300992/ 2008-09-30] and [http://lwn.net/Articles/339641/ 2009-07-08] articles on lockless ring buffers in the Linux kernel | * LWN's [http://lwn.net/Articles/300992/ 2008-09-30] and [http://lwn.net/Articles/339641/ 2009-07-08] articles on lockless ring buffers in the Linux kernel | ||
* Bencina, "[http://www.audiomulch.com/~rossb/code/lockfree/ Some Notes on Lock-Free Algorithms]" | * Bencina, "[http://www.audiomulch.com/~rossb/code/lockfree/ Some Notes on Lock-Free Algorithms]" | ||
* "[http://www.cl.cam.ac.uk/research/srg/netos/lock-free/ Practical Lock-Free Algorithms]" at Cambridge's Computer Laboratory's Systems Research Group | |||
Revision as of 14:37, 12 July 2009
Herlihy, Luchangco and Moir's 2003 paper, "Obstruction-Free Synchronization: Double-Ended Queues as an Example" pretty much revolutionized the field and is mandatory reading.
See Also
- LWN's 2008-09-30 and 2009-07-08 articles on lockless ring buffers in the Linux kernel
- Bencina, "Some Notes on Lock-Free Algorithms"
- "Practical Lock-Free Algorithms" at Cambridge's Computer Laboratory's Systems Research Group
