Check out my first novel, midnight's simulacra!
Lock-free algorithms: Difference between revisions
From dankwiki
(Created page with 'Herlihy, Luchangco and Moir's 2003 paper, "[http://www.cs.brown.edu/people/mph/HerlihyLM03/main.pdf Obstruction-Free Synchronization: Double-Ended Queues as an Example]" pretty m...') |
No edit summary |
||
| Line 1: | Line 1: | ||
Herlihy, Luchangco and Moir's 2003 paper, "[http://www.cs.brown.edu/people/mph/HerlihyLM03/main.pdf Obstruction-Free Synchronization: Double-Ended Queues as an Example]" pretty much revolutionized the field and is mandatory reading. | Herlihy, Luchangco and Moir's 2003 paper, "[http://www.cs.brown.edu/people/mph/HerlihyLM03/main.pdf Obstruction-Free Synchronization: Double-Ended Queues as an Example]" pretty much revolutionized the field and is mandatory reading. | ||
==See Also== | |||
* 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 | |||
Revision as of 09:59, 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
