Lock-free reference counting

Distributed Computing

Volumn 15, Issue 4, 2002, Pages 255-271

  Detlefs, David L ^a   Martin, Paul A ^a   Moir, Mark ^a   Steele Jr , Guy L ^a  

^a SUN MICROSYSTEMS   (United States)

Author keywords

Dynamic data structures; Lockfree synchronization; Memory management; Reference counting

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING; DATA STRUCTURES; SYNCHRONIZATION;

GARBAGE COLLECTION; LOCKFREE SYNCHRONIZATION; MEMORY MANAGEMENT; REFERENCE COUNTING;

STORAGE ALLOCATION (COMPUTER);

EID: 0036944178     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0079-z     Document Type: Article

References (26)

1. M. Ben-Ari. On-the-fly garbage collection: New algorithms inspired by program proofs. In: M. Nielsen, E. Meineche Schmidt (eds) Automata, Languages and Programming, 9th Colloquium, volume 140 of Lecture Notes in Computer Science, pp 14-22, Aarhus, Denmark, 12-16 July 1982. Berlin Heidelberg New York: Springer
2. D. Detlefs. Garbage collection and run-time typing as a C++ library. In: Proceedings of the 1992 Usenix C++ Conference, pp37-56, 1992
3. D. Detlefs, C. Flood, A. Garthwaite, P. Martin, N. Shavit, G. Steele. Even better DCAS-based concurrent deques. In: Proceedings of the 14th International Conference on Distributed Computing, pp59-73, 2000
4. J. DeTreville. Experiences with concurrent garbage collectors for modula-2+. Technical Report 64, Digital Equipment Corporation Systems Research Center, 1990
5. Dave Dice, Alex Garthwaite. Mostly lock-free malloc. In ACM SIGPLAN international symposium on Memory management. ACM Press, 2002
6. E. W. Dijkstra, L. Lamport, A. J. Martin, C. S. Scholten, E. F. M. Steffens. On-the-fly garbage collection: An exercise in cooperation. CACM 21(11):966-975, 1978
7. M. Greenwald. Non-Blocking Synchronization and System Design. PhD thesis, Stanford University Technical Report STAN-CS-TR-99-1624, Palo Alto, CA, August 1999
8. M. Herlihy V. Luchangco, P. Martin, M. Moir. Dynamic-sized lock-free data structures. Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002
9. M. Herlihy, V. Luchangco, M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. Technical Report TR-2002-112, Sun Microsystems Laboratories, 2002
10. M. Herlihy, V. Luchangco, M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In: Proceedings of the 16th International Symposium on DIStributed Computing, 2002. To appear
11. M. Herlihy, E. Moss. Lock-free garbage collection for multiprocessors. IEEE Trans Parallel Distrib Syst 3(3), 1992
12. W.H. Hesselink, J.F. Groote. Waitfree distributed memory management by create, and read until deletion (CRUD). In 113, page 17. Centrum voor Wiskunde en Informatica (CWI), ISSN 1386-369X, December 31 1998. SEN (Software Engineering (SEN))
13. Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. New York: Wiley 1996. With a chapter on Distributed Garbage Collection by R. Lins
14. D. E. Knuth. The Art of Computer Programming: Fundamental Algorithms. Reading, MA: Addison-Wesley 1968
15. H. Kung, L. Lehman. Concurrent manipulation of binary search trees. ACM Trans Database Syst 5(3):354-382, 1980
16. H. T. Kung, S. Song. An efficient parallel garbage collector and its correctness proof. Technical report, Carnegie Mellon University, September 1977
17. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans Comput C-28(9):241-248, 1979
18. Y. Levanoni, E. Petrank. A scalable reference counting garbage collector. Technical Report Technical Report CS-0967, Computer Science Department, Technion, Israel, 1999
19. M. Michael, M. Scott. 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, pp 267-276, 1996
20. M. Moir. Transparent support for wait-free transactions. In: Proceedings of the 11th International Workshop on Distributed Algorithms, pp 305-319, 1997
21. Motorola. MC68020 32-bit microprocessor user's manual. Englewood Cliffs, NJ: Prentice-Hall 1986
22. W. Pugh. Concurrent maintenance of skip lists. Technical Report CS-TR-2222.1, Department of Computer Science, University of Maryland, 1989
23. N. Shavit, D. Touitou. Software transactional memory. Distrib Comput (10):99-116, 1997
24. G.L. Steele. Multiprocessing compactifying garbage collection. Communications of the ACM, 18(9):495-508, 1975
25. J. Valois. Lock-free linked lists using compare-and-swap. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pp214-22, 1995. See http://www/cs/sunysb.edu/~valois for errata
26. J. L. A. van de Snepscheut. Algorithms for on-the-fly garbage collection revisited. Inform Process Lett 24(4):211-216, 1987