Nonblocking memory management support for dynamic-sized data structures

ACM Transactions on Computer Systems

Volumn 23, Issue 2, 2005, Pages 146-196

  Herlihy, Maurice ^a   Luchangco, Victor ^b   Martin, Paul ^b   Moir, Mark ^b  

^a BROWN UNIVERSITY   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

Concurrent data structures; Dynamic data structures; Memory management; Multiprocessors; Nonblocking synchronization

Indexed keywords

DYNAMIC MEMORY MANAGEMENT; FIFO QUEUE; THREAD-SAFE MEMORY;

DIGITAL LIBRARIES; QUEUEING THEORY; RESOURCE ALLOCATION; SYNCHRONIZATION;

DATA STRUCTURES;

EID: 27544489038     PISSN: 07342071     EISSN: 07342071     Source Type: Journal    
DOI: 10.1145/1062247.1062249     Document Type: Article

References (33)

1. AGESEN, O., DETLEFS, D., FLOOD, C., GARTHWAITE, A., MARTIN, P., MOIR, M., SHAVIT, N., AND STEELE, G. 2002. DCAS-based concurrent deques. Theory of Computing Systems 35, 349-386.
2. (A preliminary version appeared in the Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures, 2000.)
3. ANDERSON, J. AND MOIR, M. 1997. Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distrib. Comput. 11, 1-20.
4. (A preliminary version appeared in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, 1994, pp. 141-150.)
5. ANDERSON, J. AND MOIR, M. 1999. Universal constructions for large objects. IEEE Trans. Paral. Distrib. Syst. 10, 12, 1317-1332.
6. (A preliminary version appeared in the Proceedings of the 9th Annual International Workshop on Distributed Algorithms, 1995.)
7. BACON, D. F., ATTANASIO, C. R., LEE, H. B., RAJAN, V. T., AND SMITH, S. 2001. Java without the coffee breaks: A nonintrusive multiprocessor garbage collector. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation. ACM, New York, 92-103.
8. DETLEFS, D., FLOOD, C., GARTHWAITE, A., MARTIN, P., SHAVIT, N., AND STEELE, G. 2000. Even better DCAS-based concurrent deques. In Proceedings of the 14th International Conference on Distributed Computing. 59-73.
9. DETLEFS, D., MARTIN, P., MOIR, M., AND STEELE, G. 2001. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 190-199.
10. DICE, D. AND GARTHWAITE, A. 2002. Mostly lock-free malloc. In Proceedings of the ACM SIGPLAN International Symposium on Memory Management. ACM, New York.
11. DOHERTY, S., GROVES, L., LUCHANGCO, V., AND MOIR, M. 2004a. Formal verification of a practical lock-free queue algorithm. In Proceedings of the 24th Annual International Conference on Formal Techniques for Networked and Distributed Systems (FORTE). Lecture Notes in Computer Science, Vol. 3235, Springer Verlag, New York, 97-114.
12. DOHERTY, S., HERLIHY, M., LUCHANGCO, V., AND MOIR, M. 2004b. Bringing practical lock-free synchronization to 64-bit applications. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 31-39.
13. GREENWALD, M. 1999. Non-blocking synchronization and system design. Ph.D. dissertation, Stanford University Tech. Rep. STAN-CS-TR-99-1624, Palo Alto, Calif.
14. HARRIS, T. 2001. A pragmatic implementation of non-blocking linked lists. In Proceedings of the 15th International Symposium on Distributed Computing.
15. HERLIHY, M. 1991. Wait-free synchronization. ACM Trans. Prog. Lang. and Systems 13, 1, 124-149.
16. HERLIHY, M., LUCHANGCO, V., MARTIN, P., AND MOIR, M. 2002. Brief announcement: Dynamic-sized lock-free data structures. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). ACM, New York, 131.
17. HERLIHY, M., LUCHANGCO, V., AND MOIR, M. 2003. Space- and time-adaptive nonblocking algorithms. In Proceedings of Computing: The Australasian Theory Symposium (CATS).
18. LAMPORT, L. 1979. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28, 9 (Sept.), 241-248.
19. LEA, D. 2003. Concurrency jsr-166 interest site, http://gee.cs.oswego. edu/dl/concurrency-interest/.
20. LYNCH, N. AND TUTTLE, M. 1989. An introduction to input/output automata. Tech. Rep. CWI-Quarterly, 2(3), Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands.
21. MARTINEZ, J. F. AND TORRELLAS, J. 2002. Speculative synchronization: Applying thread-level speculation to explicitly parallel applications. In Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems.
22. MICHAEL, M. 2002a. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual ACM Symposium on the Principles of Distributed Computing. ACM, New York, 21-30.
23. MICHAEL, M. M. 2002b. High performance dynamic lock-free hash tables and list-based sets. In Proceeding of the 14th Annual Symposium on Parallel Algorithms and Architectures. ACM, New York, 73-82.
24. MICHAEL, M. 2004. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parall. Distrib. Syst. 15, 6 (June), 491-504.
25. MICHAEL, M. AND SCOTT, M. 1996. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing. ACM, New York, 267-276.
26. MICHAEL, M. AND SCOTT, M. 1998. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. J. Paral. Distrib. Comput. 51, 1, 1-26.
27. MOIR, M. 1997. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 219-228.
28. OPLINGER, J., AND LAM, M. S. 2002. Enhancing software reliability with speculative threads. In Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems.
29. PRINTEZIS, T. AND DETLEFS, D. 2000. A generational mostly-concurrent garbage collector. In Proceedings of the 2nd International Symposium on Memory Management. ACM, New York, 143-154.
30. RAJWAR, R. AND GOODMAN, J. R. 2002. Transactional lock-free execution of lock-based programs. In Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems.
31. TREIBER, R. 1986. Systems programming: Coping with parallelism. Tech. Rep. RJ5118, IBM Almaden Research Center.
32. VALOIS, J. 1995. Lock-free linked lists using compare-and-swap. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 214-222. (See http://www.cs.sunysb.edu/~valois for errata.)
33. WEAVER, D., AND GERMOND, T. 1994. The SPARC Architecture Manual Version 9. Prentice-Hall, Englewood Cliffs, N.J.