Check out the new USENIX Web site. next up previous
Next: About this document ... Up: Using Read-Copy-Update Techniques for Previous: Acknowledgments

Bibliography

Cao02
M. Cao [PATCH] Latest IPC lock patch- 2.5.44, Linux Kernel Mailing List, October 2002. https://marc.theaimsgroup.com/?l=linux-kernel&m=103610704923787&w=2.

Gamsa99
B. Gamsa, O. Kreiger, J. Appavoo, and M. Stumm. Tornado: maximizing locality and concurrency in a shared memory multiprocessor operating system, Proceedings of the 3rd Symposium on Operating System Design and Implementation, New Orleans, LA, February, 1999.

Hartner02
B. Hartner. semopbench 1.0.0, IBM DeveloperWorks, October 2002. https://www.ibm.com/developerworks/opensource/linuxperf/semopbench/semopbench.c.

Herlihy93
M. Herlihy. Implementing Highly Concurrent Data Objects, ACM Transactions on Programming Languages and Systems, vol. 15 #5, November 1993, pages 745-770.

Linder02a
H. Linder, D. Sarma, and Maneesh Soni. Scalability of the Directory Entry Cache, Ottawa Linux Symposium, June 2002.

LSE
D. Sarma et al. Linux Scaling Effort (LSE), SourceForge Project, April 2002. https://prdownloads.sourceforge.net/lse/.

McK98a
P. E. McKenney and J. D. Slingwine. Read-copy update: using execution history to solve concurrency problems, Parallel and Distributed Computing and Systems, October 1998. (revised version available at https://www.rdrop.com/users/paulmck/rclockpdcsproof.pdf).

McK01b
P. E. McKenney, J. Appavoo, A. Kleen, O. Krieger, R. Russell, D. Sarma, M. Soni. Read-Copy Update, Ottawa Linux Symposium, July 2001. (revised version available at https://www.rdrop.com/users/paulmck/rclock/rclock_OLS.2001.05.01c.pdf).

McK02a
P. E. McKenney, D. Sarma, A. Arcangeli, A. Kleen, O. Krieger, and R. Russell. Read-Copy Update, Ottawa Linux Symposium, July 2002. (revised version available at https://www.rdrop.com/users/paulmck/rclock/rcu.2002.07.08.pdf).

Michael02a
M. M. Michael. Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes, In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pages 21-30, July 2002.

Michael02b
M. M. Michael. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets, In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architecture, pages 73,82, August 2002.

Pugh90
W. Pugh. Concurrent Maintenance of Skip Lists, Department of Computer Science, University of Maryland, CS-TR-2222.1, June 1990.

Sarma02
D. Sarma [PATCH] Read-Copy Update 2.5.42, Linux-Kernel Mailing List, October 2002. https://marc.theaimsgroup.com/?l=linux-kernel&m=103461974415359&w=2.

Spraul01
M. Spraul Re: RFC: patch to allow lock-free traversal of lists with insertion, Linux-Kernel Mailing List, October 2001. https://marc.theaimsgroup.com/?l=linux-kernel&m=100264675012867&w=2.



Paul McKenney 2003-03-28