Lock-free parallel garbage collection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3758 LNCS, Issue , 2005, Pages 263-274

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

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; COMPUTER ARCHITECTURE; DATA STRUCTURES; MATHEMATICAL MODELS; SYNCHRONIZATION; THEOREM PROVING;

HIGHER-LEVEL ATOMIC STEPS; LOCK-FREE PARALLEL GARBAGE COLLECTIONS; MUTATORS; SYNCHRONIZATION PRIMITIVES;

PARALLEL ALGORITHMS;

EID: 33646710348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11576235_31     Document Type: Conference Paper

References (21)

1. G. Barnes. A method for implementing lock-free data structures. In Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, June 1993.
2. M. Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on programming Languages and Systems, 6(3):333-344, 1984.
3. B.N. Bershad. Practical considerations for non-blocking concurrent objects. In Proceedings of the Thirteenth International Conference on Distributed Computing Systems, pages 264-274, 1993.
4. E. Cohen and L. Lamport. Reduction in TLA. In Proceedings of the 9th International Conference on Concurrency Theory, pages 317-331, 1998.
5. D.L. Detlefs, P.A. Martin, M. Moir, and G.L. Steele Jr. Lock-free reference counting. Distributed Computing, 15(4):255-71, December 2002.
6. B.W. Dijkstra, L. Lamport, A.J. Martin, O.S. Scholten, and E.F.M. Steffens. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11):966-975, November 1978.
7. T. Endo, K. Taura, and A. Yonezawa. A scalable mark-sweep garbage collector on large-scale shared-memory machines. In Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), pages 1-14. ACM Press, 1997.
8. C. Flood, D. Detlefs, N. Shavit, and C. Zhang. Parallel garbage collection for shared memory multiprocessors. In Usenix Java Virtual Machine Research and Technology Symposium (JVM '01), Monterey, CA, April 2001.
9. H. Gao, J.F. Groote, and W.H. Hesselink. Almost wait-free resizable hashtables (extended abstract). In Proceedings of 18th International Parallel & Distributed Processing Symposium (IPDPS), April 2004.
10. H. Gao, J.F. Groote, and W.H. Hesselink. Lock-free parallel garbage collection by mark&sweep. Technical Report CS-Report CSR-04-31, Eindhoven University of Technology, The Netherlands, 2004.
11. H. Gao and W.H. Hesselink. A formal reduction for lock-free parallel algorithms. In Proceedings of the 16th conference on Computer Aided Verification (CAV), July 2004.
12. M. Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems, 15(5):745-770, November 1993.
13. M.P. Herlihy and J.E.B. Moss. Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 3(3):304-311, 1992.
14. W.H. Hesselink, http://www.cs.rug.nl/~wim/mechver /garbage_collection
15. W.H. Hesselink and J.F. Groote. Wait-free concurrent memory management by Create, and Read until Deletion. Distributed Computing, 14(1):31-39, January 2001.
16. E.H. Jensen, G.W. Hagensen, and J.M. Broughton. A new approach to exclusive data access in shared memory multiprocessors. Technical Report UCRL-97663, Lawrence Livemore National Laboratory, January 1987.
17. P.C. Kanellakis and A. A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic Publishers, 1997.
18. V. Luchangco, M. Moir, and N. Shavit. Nonblocking k-compare-single-swap. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pages 314-323. ACM Press, 2003.
19. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
20. M. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 21-30. ACM Press, 2002.
21. H. Sundell and P. Tsigas. Scalable and lock-free concurrent dictionaries. In Proceedings of the 2004 ACM Symposium on Applied computing, pages 1438-1445, 2004.