A construction of distributed reference counting

Acta Informatica

Volumn 37, Issue 8, 2001, Pages 563-595

  Moreau, Luc ^a   Duprat, Jean ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035324731     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013315     Document Type: Article

References (45)

1. 1. B. Barras, S. Boutin, C. Cornes, J. Courant, J.C. Filliatre, E. Giménez, H. Herbelin, G. Huet, C. Mu noz, C. Murthy, C. Parent, C. Paulin, A. Saïbi, B. Werner: The Coq Proof Assistant Reference Manual - Version V6.1. Technical Report 0203, INRIA, August 1997
2. 2. M. Ben-Ari: Algorithms for on-the-fly garbage collection. ACM Trans Programm Lang Syst 6(3): 333-344 (1984)
3. 3. D.I. Bevan: Distributed Garbage Collection using Reference Counting. In: PARLE Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, Vol 259, pp 176-187. Berlin Heidelberg New York: Springer 1987
4. 4. A. Birrell, D. Evers, G. Nelson, S. Owicki, E. Wobber: Distributed Garbage Collection for Network Objects. Technical Report 116, Digital Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, December 1993
5. 5. G.E. Collins: A Method for Overlapping and Erasure of Lists. Communications of the ACM 3(12): 655-657 (1960)
6. 6. P. Dickman: Optimising Weighted Reference Counts for Scalable Fault-Tolerant Distributed Object-Support Systems, 1992
7. 7. E.W. Dijkstra, L. Lamport, A.J. Martin, C.S. Scholten, E.F.M. Steffens: On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM 21(11): 966-975 (1978)
8. 8. D. Doligez, G. Gonthier: Portable, Unobtrusive Garbage Collection for Multiprocessor Systems. In: ACM Conference on Principles of Programming Languages, pp 70-83, 1994
9. 9. I. Foster: A Multicomputer Garbage Collector for a Single-Assignment Language. Int J Parallel Program 18(3): 181-203 (1989)
10. 10. I. Foster, C. Kesselman, S. Tuecke: The Nexus Approach to Integrating Multithreading and Communication. J Parallel Distrib Comput 37: 70-82 (1996)
11. 11. H. Goguen, R. Brooksby, R. Burstall: An Abstract Formulation of Memory Management. Available from http://www.dcs.ed.ac.uk/~hhg/, December 1998
12. 12. B. Goldberg: Generational Reference Counting: A Reduced-Communication Distributed Storage Reclamation Scheme. In: SIGPLAN Programming Language Design and Implemantation PLDI' 89, pp 313-320, 1989
13. 13. G. Gonthier: Verifying the Safety of a Practical Concurrent Garbage Collector. In: R. Alur, T. Henzinger (eds) Computer Aided Verification CAV'96. Lecture Notes in Computer Science, Vol 1102, pp 462-465. Berlin Heidelberg New York: Springer 1996
14. 14. K. Havelund, N. Shankar: A mechanized refinement proof for a garbage collector. Available from http://www.cs.auc.dk/~havelund/, 1997
15. 15. R.L. Hudson, R. Morrison, J.E.B. Moss, D.S. Munro: Garbage Collecting the World: One Car at a Time. In: Proceedings of OOPSLA'97, Atlanta, USA, 1997
16. 16. G. Huet, G. Kahn, C. Paulin-Mohring: The Coq Proof Assistant - Tutorial. Technical report, INRIA, 1999. Available from coq.inria.fr
17. 17. P.B. Jackson. Verifying a garbage collection algorithm. In: Proceedings of 11th International Conference on Theorem Proving in Higher Order Logics TPHOLs'98. Lecture Notes in Computer Science, Vol 1479, pp 225-244. Berlin Heidelberg New York: Springer 1998
18. 18. Java Remote Method Invocation Specification. November 1996
19. 19. R. Jones. R. Lins: Garbage Collection. Algorithms for Automatic Dynamic Memory Management. New York: Wiley, 1996
20. 20. L. Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7): 558-565 (1978)
21. 21. B. Lang, C. Queinnec, J. Piquer: Garbage Collecting the World. In: Proceedings of the Nineteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp 39-50, Albuquerque, New Mexico, January 1992
22. 22. F. Le Fessant, I. Piumarta, M. Shapiro: A Detection Algorithm for Distributed Cycles of Garbage. In: OOPSLA'97 Garbage Collection and Memory Management Workshop. http://www.dcs.gla.ac.uk/~huw/oopsla97/gc/papers.html, 1997
23. 23. C.-W. Lermen, D. Maurer: A Protocol for Distributed Reference Counting. In: Lisp and Functional Programming, pp 343-354, 1986
24. 24. R.D. Lins, R.E. Jones: Cyclic weighted reference counting. In: K. Boyanov (ed) Procedings of WP & DP'93 Workshop on Parallel and Distributed Processing. Amsterdam: North-Holland, May 1993
25. 25. L.V. Mancini, S.K. Shrivastava: Fault-tolerant reference counting for garbage collection in distributed systems. Computer Journal 34(6): 503-513 (1991)
26. 26. Z. Manna, M. Pnuelli: Temporal Logic or Reactive and Concurrent Systems: Specification. Berlin Heidelberg New York: Springer 1991
27. 27. L. Moreau: A Distributed Garbage Collector with Diffusion Tree Reorganisation and Object Mobility. In: Proceedings of the Third International Conference of Functional Programming (ICFP'98), pp 204-215, September 1998. Also in ACM SIGPLAN Notices 34(1): 204-215 (1999)
28. 27. L. Moreau: A Distributed Garbage Collector with Diffusion Tree Reorganisation and Object Mobility. In: Proceedings of the Third International Conference of Functional Programming (ICFP'98), pp 204-215, September 1998. Also in ACM SIGPLAN Notices 34(1): 204-215 (1999)
29. 28. L. Moreau: Hierarchical Distributed Reference Counting. In: Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98), pp 57-67, Vancouver, BC, Canada, October 1998. Also in ACM SIGPLAN Notices 34(3): 57-67 (1999)
30. 28. L. Moreau: Hierarchical Distributed Reference Counting. In: Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98), pp 57-67, Vancouver, BC, Canada, October 1998. Also in ACM SIGPLAN Notices 34(3): 57-67 (1999)
31. 29. L. Moreau, D. DeRoure, I. Foster: NeXeme: a Distributed Scheme Based on Nexus. In: Third International Europar Conference (EURO-PAR'97), Passau, Germany, August 1997. Lecture Notes in Computer Science, Vol 1300, pp 581-590. Berlin Heidelberg New York: Springer
32. 30. L. Moreau, J. Duprat: A Construction of Distributed Reference Counting: the Constructive Proof in Coq. Available from http://www.staff.ecs.soton.ac.uk/~lavm/coq/drc/, February 1999
33. 31. L. Moreau, C. Queinnec: Design and Semantics of Quantum: a Language to Control Resource Consumption in Distributed Computing. In: Usenix Conference on Domain-Specific Languages (DSL'97), pp 183-197, Santa-Barbara, California, October 1997
34. 32. J.M. Piquer: Indirect Reference Counting: A Distributed Garbage Collection Algorithm. In: Parallel Architectures and Languages Europe (PARLE'91), pp 150-165, 1991
35. 33. J.M. Piquer: Indirect Distributed Garbage Collection: Handling Object Migration. ACM Trans Program Lang Syst 18(5): 615-647 (1996)
36. 34. D. Plainfossé, M. Shapiro: A Survey of Distributed Garbage Collection Techniques. In: H.G. Baker (ed) International Workshop on Memory Management (IWMM95), Kinross, Scotland, 1995. Lecture Notes in Computer Science, Vol 986, pp 211-249, Berlin Heidelberg New York: Springer 1995
37. 34. D. Plainfossé, M. Shapiro: A Survey of Distributed Garbage Collection Techniques. In: H.G. Baker (ed) International Workshop on Memory Management (IWMM95), Kinross, Scotland, 1995. Lecture Notes in Computer Science, Vol 986, pp 211-249, Berlin Heidelberg New York: Springer 1995
38. 35. H.C.C.D. Rodrigues, R.E. Jones: A Cyclic Distributed Garbage Collector for Network Objects. In: Tenth International Workshop on Distributed Algorithms WDAG'96, Bologna, October 1996. Lecture Notes in Computer Science, Vol 1151. Berlin Heidelberg New York: Springer 1996
39. 35. H.C.C.D. Rodrigues, R.E. Jones: A Cyclic Distributed Garbage Collector for Network Objects. In: Tenth International Workshop on Distributed Algorithms WDAG'96, Bologna, October 1996. Lecture Notes in Computer Science, Vol 1151. Berlin Heidelberg New York: Springer 1996
40. 36. D.M. Russinoff: A Mechanically Verified Incremental Garbage Collector. Formal Aspects of Computing, 1992
41. 37. M. Shapiro, P. Dickman, D. Plainfossé: Robust, Distributed References and Acyclic Garbage Collection. In: Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1992
42. 38. M. Shapiro, P. Dickman, D. Plainfossé: SSP Chains: Robust, Distributed References Supporting Acyclic Garbage Collection. Rapport de Recherche 1799, INRIA-Rocquencourt, November 1992
43. 39. M. Shapiro, O. Gruber, D. Plainfossé: A garbage detection protocol for a realistic distributed object-support system. Rapport de Recherche 1320, Inria-Rocquencourt, November 1990
44. 40. G. Tel, F. Mattern: The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes. ACM Trans Program Lang Syst 15(1): 1-35 (1993)
45. 41. P. Watson, I. Watson: An Efficient Garbage Collection Scheme for Parallel Computer Architectures. In: PARLE Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, Vol 259, pp432-443. Berlin Heidelberg New York: Springer 1987