Lock-free parallel and concurrent garbage collection by mark&sweep

Science of Computer Programming

Volumn 64, Issue 3, 2007, Pages 341-374

  Gao, H ^a   Groote, J F ^b   Hesselink, W H ^c  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Correctness; Garbage collection; Lock free; Shared memory; Theorem proving

Indexed keywords

CONCURRENT ENGINEERING; DATA REDUCTION; MATHEMATICAL MODELS; SYNCHRONIZATION; THEOREM PROVING;

GARBAGE COLLECTION; LOCK-FREE; SHARED-MEMORY;

ALGORITHMS;

EID: 37849189689     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2006.10.001     Document Type: Article

References (55)

1. Apt K.R., and Olderog E.-R. Verification of Sequential and Concurrent Programs (1991), Springer, New York
2. Azatchi H., Levanoni Y., Paz H., and Petrank E. An on-the-fly mark and sweep garbage collector based on sliding views. Proceedings of the 18th ACM SIGPLAN Conference on Object-oriented Programing, Systems, Languages, and Applications (2003), ACM Press 269-281
3. Back R.J.R., and von Wright J. Stepwise refinement of distributed systems: Models, formalism, correctness: Refinement calculus. In: de Bakker J.W., de Roever W.-P., and Rozenberg G. (Eds). Stepwise Refinement of Distributed Systems. Lecture Notes in Computer Science vol. 430 (1990), Springer-Verlag 42-93
4. G. Barnes, A method for implementing lock-free data structures, in: Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, June 1993, pp. 261-270
5. Ben-Ari M. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems 6 3 (1984) 333-344
6. B.N. Bershad, Practical considerations for non-blocking concurrent objects, in: Proceedings of the Thirteenth International Conference on Distributed Computing Systems, 1993, pp. 264-274
7. Boehm H., Demers A.J., and Shenker S. Mostly parallel garbage collection. Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation (1991), ACM Press 157-164
8. van den Brand M.G.J., de Jong H.A., Klint P., and Olivier P.A. Efficient annotated terms. Software, Practice and Experience 30 3 (2000) 259-291
9. Chandy K.M. Parallel Program Design: A Foundation (1988), Addison-Wesley Longman Publishing Co., Inc.
10. E. Cohen, L. Lamport, Reduction in TLA, in: Proceedings of the 9th International Conference on Concurrency Theory, 1998, pp. 317-331
11. C. Cornes, J. Courant, et al., The coq proof assistant - reference manual v 6.1, 1997
12. Detlefs D.L., Martin P.A., Moir M., and Steele Jr. G.L. Lock-free reference counting. Distributed Computing 15 4 (2002) 255-271
13. Dijkstra E.W., Lamport L., Martin A.J., Scholten C.S., and Steffens E.F.M. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM 21 11 (1978) 966-975
14. D. Doligez, X. Leroy, A concurrent generational garbage collector for a multi-threaded implementation of ML, in: Proceedings of the 1993 ACM Symposium on Principles of Programming Languages, January 1993, pp. 113-123
15. Endo T., Taura K., and Yonezawa A. A scalable mark-sweep garbage collector on large-scale shared-memory machines. Proceedings of the 1997 ACM/IEEE Conference on Supercomputing. (CDROM) (1997), ACM Press 1-14
16. C. Flood, D. Detlefs, N. Shavit, C. Zhang, Parallel garbage collection for shared memory multiprocessors, in: Usenix Java Virtual Machine Research and Technology Symposium, JVM '01, Monterey, CA, April 2001
17. Gao H., Groote J.F., and Hesselink W.H. Lock-free dynamic hash tables with open addressing. Distributed Computing 17 (2005) 21-42
18. Gao H., Groote J.F., and Hesselink W.H. Almost wait-free resizable hashtables (extended abstract). Proceedings of 18th International Parallel and Distributed Processing Symposium. IPDPS (April 2004), IEEE Computer Society
19. H. Gao, J.F. Groote, W.H. Hesselink, Lock-free parallel garbage collection by mark&sweep, Technical Report CS-Report 04-31, Eindhoven University of Technology, The Netherlands, 2004
20. Gao H., Groote J.F., and Hesselink W.H. Lock-free parallel garbage collection. In: Pan Y., Chen D., Guo M., Cao J., and Dongarra J. (Eds). Proceedings of Third International Symposium on Parallel and Distributed Processing and Applications. ISPA'05. LNCS vol. 3758 (2005), Springer 263-274
21. H. Gao, W.H. Hesselink, A formal reduction for lock-free parallel algorithms, in: Proceedings of the 16th Conference on Computer Aided Verification, CAV, July 2004
22. H. Gao, W.H. Hesselink, A general lock-free algorithm using compare-and-swap, Information and Computation, in press (doi:10.1016/j.ic.2006.10.003). http://www.cs.rug.nl/~wim/mechver/lockfree_reduction, 2004
23. Groote J.F., Hesselink W.H., Mauw S., and Vermeulen R. An algorithm for the asynchronous write-all problem based on process collision. Distributed Computing 14 (2001) 75-81
24. Havelund K. Mechanical verification of a garbage collector. In: Rolim J., et al. (Ed). Parallel and Distributed Processing (Combined Proceedings of 11 Workshops). Lecture Notes in Computer Science vol. 1586 (April~1999), Springer-Verlag 1258-1283 Presented at the Workshop on Formal Methods for Parallel Programming: Theory and Applications, FMPPTA
25. Herlihy M. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems 15 5 (1993) 745-770
26. Herlihy M.P., Luchangco V., and Moir M. The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structure. Proceedings of 16th International Symposium on Distributed Computing (October~2002), Springer-Verlag 339-353
27. Herlihy M.P., and Moss J.E.B. Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3 3 (1992) 304-311
28. Hesselink W.H. http://www.cs.rug.nl/~wim/mechver/garbage_collection
29. Hesselink W.H. Using eternity variables to specify and prove a serializable database interface. Science of Computer Programming 51 (2004) 47-85
30. Hesselink W.H., and Groote J.F. Wait-free concurrent memory management by Create, and Read until Deletion. Distributed Computing 14 1 (2001) 31-39
31. Hudson R.L., and Moss J.E.B. Sapphire: Copying GC without stopping the world. ISCOPE Conference on ACM 2001 Java Grande (2001), ACM Press 48-57
32. Huelsbergen L., and Larus J.R. A concurrent copying garbage collector for languages that distinguish (im)mutable data. Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (1993), ACM Press 73-82
33. Jackson P.B. Verifying a garbage collection algorithm. Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics TPHOLs'98. LNCS vol. 1479 (1998) 225-244
34. E.H. Jensen, G.W. Hagensen, J.M. Broughton, A new approach to exclusive data access in shared memory multiprocessors, Technical Report UCRL-97663, Lawrence Livemore National Laboratory, January 1987
35. Jones R., and Lins R. Garbage Collection: Algorithms for Automatic Dynamic Memory Management (1996), John Wiley & Sons, Inc.
36. Jonker J.E. On-the-fly garbage collection for several mutators. Distributed Computing 5 (1992) 187-199
37. Kanellakis P.C., and Shvartsman A.A. Fault-Tolerant Parallel Computation (1997), Kluwer Academic Publishers
38. Lamport L. The temporal logic of actions. ACM Transactions on Programming Languages and Systems 16 3 (1994) 872-923
39. Levanoni Y., and Petrank E. An on-the-fly reference counting garbage collector for Java. Proceedings of the 16th ACM SIGPLAN Conference on Object-oriented Programming, Systems, Languages, and Applications (2001), ACM Press 367-380
40. Luchangco V., Moir M., and Shavit N. Nonblocking k-compare-single-swap. Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (2003), ACM Press 314-323
41. Lynch N.A. Distributed Algorithms (1996), Morgan Kaufmann Publishers
42. H. Massalin, C. Pu, A lock-free multiprocessor OS kernel, Technical Report CUCS-005-91, Columbia University, 1991
43. Michael M.M. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (2002), ACM Press 21-30
44. Michael M.M. High performance dynamic lock-free hash tables and list-based sets. Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures (2002), ACM Press 73-82
45. Moir M. Practical implementations of non-blocking synchronization primitives. Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (1997), ACM Press 219-228
46. A.J. Mooij, Non-blocking implementations of LL, VL and SC, 2004, private communication
47. Moreau L., and Duprat J. A construction of distributed reference counting. Acta Informatica 37 8 (2001) 563-595
48. O'Toole J., and Nettles S. Concurrent replicating garbage collection. Proceedings of the 1994 ACM Conference on LISP and Functional Programming (1994), ACM Press 34-42
49. Owicki S., and Gries D. An axiomatic proof technique for parallel programs. Acta Informatica 6 (1976) 319-340
50. Owicki S., and Lamport L. Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems 4 (1982) 455-495
51. S. Owre, N. Shankar, J.M. Rushby, D.W.J. Stringer-Calvert, PVS Version 2.4: System Guide, Prover Guide, PVS Language Reference, 2001
52. Rodrigues H., and Jones R. Cyclic distributed garbage collection with group merger. Proceedings of 12th European Conference on Object-Oriented Programming. ECOOP98 (July 1998), Springer, Brussels 249-273
53. Russinoff D.M. A mechanically verified incremental garbage collector. Formal Aspects of Computing 6 (1994) 359-390
54. H. Sundell, P. Tsigas, Scalable and lock-free concurrent dictionaries, in: Proceedings of the 2004 ACM Symposium on Applied Computing, 2004, pp. 1438-1445
55. Valois J.D. Lock-free linked lists using compare-and-swap. Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (1995), ACM Press 214-222