Scalable address spaces using RCU balanced trees

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn , Issue , 2012, Pages 199-210

  Clements, Austin T ^a   Kaashoek, M Frans ^a   Zeldovich, Nickolai ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

concurrent balanced trees; lock free algorithms; multicore; RCU; scalability; virtual memory

Indexed keywords

BALANCED TREES; LOCK-FREE ALGORITHMS; MULTI CORE; RCU; VIRTUAL MEMORY;

CACHE MEMORY; COMPUTER OPERATING SYSTEMS; DESIGN; FORESTRY; SCALABILITY;

BINARY TREES;

ALGORITHMS; BINARY SYSTEMS; COMPUTER PROGRAMS; THREE DIMENSIONAL DESIGN;

EID: 84858765079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2150976.2150998     Document Type: Conference Paper

References (24)

1. S. Adams. Implementing sets efficiently in a functional language. Technical Report CSTR 92-10, University of Southampton, 1992.
2. C. Bienia. Benchmarking Modern Multiprocessors. PhD thesis, Princeton University, January 2011.
3. S. Boyd-Wickizer, H. Chen, R. Chen, Y. Mao, F. Kaashoek, R. Morris, A. Pesterev, L. Stein, M. Wu, Y. D. Y. Zhang, and Z. Zhang. Corey: An operating system for many cores. In Proc. of the 8th OSDI, December 2008.
4. S. Boyd-Wickizer, A. Clements, Y. Mao, A. Pesterev, M. F. Kaashoek, R. Morris, and N. Zeldovich. An analysis of Linux scalability to many cores. In Proc. of the 9th OSDI, Vancouver, Canada, October 2010.
5. J. Evans. A scalable concurrent malloc (3) implementation for FreeBSD. In Proc. of the BSDCan Conference, Ottawa, Canada, April 2006.
6. K. Fraser. Practical lock freedom. Technical Report UCAM-CL-TR-579, Cambridge University, 2003.
7. K. Fraser and T. Harris. Concurrent programming without locks. ACM Transactions on Computer Systems, 25(2), May 2007.
8. M. Herlihy. A methodology for implementing highly concurrent data objects. Technical Report CRL 91/10, Digital Equipment Corporation, October 1991.
9. P. W. Howard and J. Walpole. Relativistic red-black trees. Technical Report 10-06, Portland State University, Computer Science Department, 2010.
10. P. L. Lehman and S. B. Yao. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems, 6:650-670, December 1981.
11. Linux Test Project. http://ltp.sourceforge.net/.
12. Y. Mao, R. Morris, and F. Kaashoek. Optimizing MapReduce for multicore architectures. Technical Report MIT-CSAIL-TR-2010-020, MIT CSAIL, May 2010.
13. P. E. McKenney. Exploiting Deferred Destruction: An Analysis of Read-Copy-Update Techniques in Operating System Kernels. PhD thesis, OGI School of Science and Engineering at Oregon Health and Sciences University, 2004. Available: http://www.rdrop.com/users/paulmck/RCU/RCUdissertation.2004.07.14e1. pdf.
14. P. E. McKenney. Sleepable RCU. Available: http://lwn.net/Articles/202847/ Revised: http://www.rdrop.com/users/paulmck/RCU/srcu.2007.01.14a.pdf, October 2006.
15. P. E. McKenney and J. D. Slingwine. Read-copy update: Using execution history to solve concurrency problems. In Proc. of the 10th IASTED International Conference on Parallel and Distributed Computing and Systems, pages 509-518, Las Vegas, NV, October 1998.
16. P. E. McKenney and J. Walpole. Introducing technology into the Linux kernel: a case study. SIGOPS Operating Systems Review, 42(5):4-17, July 2008.
17. P. E. McKenney, J. Appavoo, A. Kleen, O. Krieger, R. Russell, D. Sarma, and M. Soni. Read-copy update. In Proc. of the Ottawa Linux Symposium, pages 338-367, July 2001.
18. Microsoft Corp. Windows research kernel. http://www.microsoft.com/ resources/sharedsource/windowsacademic/researchkernelkit.mspx.
19. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. In Proc. of the 4th STOC, pages 137-142, Denver, CO, 1972.
20. W. Pugh. Concurrent maintenance of skip lists. Technical Report CS-TR-2222, Dept. of Computer Science, University of Maryland, College Park, 1990.
21. QEMU. http://www.qemu.org/.
22. S. Schneider, C. D. Antonopoulos, and D. S. Nikolopoulos. Scalable locality-conscious multithreaded memory allocation. In Proc. of the 2006 ACM SIGPLAN International Symposium on Memory Management, Ottawa, Canada, June 2006.
23. J. Stribling, J. Li, I. G. Councill, M. F. Kaashoek, and R. Morris. Overcite: A distributed, cooperative CiteSeer. In Proc. of the 3rd NSDI, San Jose, CA, May 2006.
24. L. Wang. Windows 7 memory management, November 2009. http://download. microsoft.com/download/7/E/7/7E7662CF-CBEA-470B-A97E-CE7CE0D98DC2/mmwin7.pptx.