Performance of memory reclamation for lockless synchronization

Journal of Parallel and Distributed Computing

Volumn 67, Issue 12, 2007, Pages 1270-1285

  Hart, Thomas E ^a   McKenney, Paul E ^b   Brown, Angela Demke ^a   Walpole, Jonathan ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b IBM   (United States)

^c Portland State University   (United States)

Author keywords

Concurrency; Hazard pointers; Lockless; Memory reclamation; Non blocking; Performance; Read copy update; Synchronization

Indexed keywords

BENCHMARKING; CONCURRENT ENGINEERING; MULTIPROCESSING SYSTEMS; SYNCHRONIZATION;

HAZARD POINTERS; MEMORY RECLAMATION; MICROBENCHMARK; MULTIPROCESSORS; READ COPY UPDATES;

STORAGE ALLOCATION (COMPUTER);

EID: 35748967615     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.04.010     Document Type: Article

References (39)

1. Adve S.V., and Gharachorloo K. Shared memory consistency models: a tutorial. IEEE Comput. 29 12 (1996) 66-76
2. Anderson T.E. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1 1 (1990) 6-16
3. A. Arcangeli, M. Cao, P.E. McKenney, D. Sarma, Using read-copy update techniques for System V IPC in the Linux 2.5 kernel, in: Proceedings of the 2003 USENIX Annual Technical Conference (FREENIX Track), USENIX Association, 2003.
4. E. Berger, K. McKinley, R. Blumofe, P. Wilson, Hoard: a scalable memory allocator for multithreaded applications, in: Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, MA, 2000.
5. H.-J. Boehm, An almost non-blocking stack, in: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, ACM Press, New York, NY, USA, 2004.
6. J. Bonwick, J. Adams, Magazines and Vmem: extending the slab allocator to many CPUs and arbitrary resources, in: USENIX Technical Conference, General Track, 2001.
7. Chandra T.D., and Toueg S. Unreliable failure detectors for reliable distributed systems. J. ACM 43 2 (1996) 225-267
8. Detlefs D.L., Martin P.A., Moir M., and Steele Jr. G.L. Lock-free reference counting. Distrib. Comput. 15 4 (2002) 255-271
9. K. Fraser, Practical lock-freedom, Ph.D. Thesis, University of Cambridge Computer Laboratory, 2004.
10. B. Gamsa, O. Krieger, J. Appavoo, M. Stumm, Tornado: maximizing locality and concurrency in a shared memory multiprocessor operating system, in: Proceedings of the Third Symposium on Operating Systems Design and Implementation, USENIX Association, Berkeley, CA, USA, 1999.
11. A. Gidenstam, M. Papatriantafilou, H. Sundell, P. Tsigas, Efficient and reliable lock-free memory reclamation based on reference counting, in: Proceedings of the Eighth International Symposium on Parallel Architectures, Algorithms and Networks, IEEE Computer Society, Washington, DC, USA, 2005.
12. M. Greenwald, Non-blocking synchronization and system design, Ph.D. Thesis, Stanford University, 1999.
13. M. Greenwald, D. Cheriton, The synergy between non-blocking synchronization and operating system structure, in: Proceedings of the Second USENIX Symposium on Operating Systems Design and Implementation, ACM Press, 1996.
14. R. Gupta, The fuzzy barrier: a mechanism for high speed synchronization of processors, in: Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems, ACM Press, New York, NY, USA, 1989.
15. T.L. Harris, A pragmatic implementation of non-blocking linked-lists, in: Proceedings of the 15th International Conference on Distributed Computing, Springer, Berlin, 2001.
16. Herlihy M. Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13 1 (1991) 124-149
17. Herlihy M. A methodology for implementing highly concurrent data objects. ACM Trans. Prog. Lang. Meth. 15 5 (1993) 745-770
18. M. Herlihy, V. Luchangco, M. Moir, The repeat offender problem: a mechanism for supporting dynamic-sized, lock-free data structures, in: Proceedings of the 16th International Symposium on Distributed Computing, 2002.
19. M. Herlihy, V. Luchangco, M. Moir, Obstruction-free synchronization: double-ended queues as an example, in: Proceedings of the 23rd International Conference on Distributed Computing Systems, IEEE Computer Society, 2003.
20. IBM, IBM System/370 Extended Architecture, Principles of Operation, No. SA22-7085, 1983.
21. Kontothanassis L.I., Wisniewski R.W., and Scott M.L. Scheduler-conscious synchronization. ACM Trans. Comput. Syst. 15 1 (1997) 3-40
22. S. Kumar, D. Jiang, R. Chandra, J.P. Singh, Evaluating synchronization on shared address space multiprocessors: methodology and performance, in: Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, ACM Press, New York, NY, USA, 1999.
23. Lamport L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28 9 (1979) 690-691
24. P.E. McKenney, Exploiting deferred destruction: an analysis of read-copy-update techniques in operating system kernels, Ph.D. Thesis, OGI School of Science and Engineering at Oregon Health and Sciences University, 2004.
25. P.E. McKenney, Real-time preemption and RCU, available: 〈http://lkml.org/lkml/2005/3/17/199〉 March 2005, (Viewed September 5, 2005).
26. P.E. McKenney, J. Appavoo, A. Kleen, O. Krieger, R. Russell, D. Sarma, M. Soni, Read-copy update, in: Proceedings of the 2001 Ottawa Linux Symposium, 2001.
27. P.E. McKenney, D. Sarma, Towards hard realtime response from the Linux kernel on SMP hardware, in: linux.conf.au, Canberra, AU, 2005.
28. P.E. McKenney, J.D. Slingwine, Read-copy update: using execution history to solve concurrency problems, in: Proceedings of the 1998 International Conference on Parallel and Distributed Computing and Systems, Las Vegas, NV, 1998.
29. M.M. Michael, Safe memory reclamation for dynamic lock-free objects using atomic reads and writes, in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, 2002.
30. Michael M.M. Hazard pointers: safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. 15 6 (2004) 491-504
31. M.M. Michael, Scalable lock-free dynamic memory allocation, in: Proceedings of the ACM Conference on Programming Language Design and Implementation, 2004.
32. M.M. Michael, M.L. Scott, Correction of a memory management method for lock-free data structures, Technical Report TR599, Computer Science Department, University of Rochester, December 1995.
33. Open Source Development Labs, Inc., Database test suite, available: 〈http://www.osdl.org/lab_activities/kernel_testing/osdl_database_test_su%ite/〉 2003, (Viewed June 29, 2005).
34. D. Sarma, P.E. McKenney, Issues with selected scalability features of the 2.6 kernel, in: Proceedings of the 2004 Ottawa Linux Symposium, 2004.
35. J. Seigh, RCU + SMR for preemptive kernel/user threads, linux-kernel mailing list, available: 〈http://lkml.org/lkml/2005/5/9/129〉, 2005.
36. H. Sundell, Efficient and practical non-blocking data structures, Ph.D. Thesis, Chalmers University of Technology, 2004.
37. H. Sundell, Wait-free reference counting and memory management, in: Proceedings of the 19th International Parallel and Distributed Processing Symposium, 2005.
38. H. Sundell, P. Tsigas, Lock-free and practical doubly linked list-based deques using single-word compare-and-swap, in: Proceedings of the Eighth International Conference on Principles of Distributed Systems, 2004.
39. J.D. Valois, Lock-free linked lists using compare-and-swap, in: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, 1995.