A distributed garbage collection algorithm

  • John Hughes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 201)


Active Process Local Computation Garbage Collection Circular Structure Accessible Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. A. M. Ali, Object-Oriented Storage Management and Garbage Collection in Distributed Processing Systems, Royal Institute of Technology, Stockholm (December 1984), PhD thesis.Google Scholar
  2. [2]
    H. Baker, "List Processing in Real-time on a Serial Computer", Communications of the ACM, Vol. 21 no. 4, pp. 280–294 (April 1978).Google Scholar
  3. [3]
    M. Ben-Ari, "Algorithms for On-the-Fly Garbage Collection", ACM Transactions on Programming Languages and Systems, Vol. 6 no. 3, pp. 333–344 (July 1984).Google Scholar
  4. [4]
    D. Brownbridge, Private Communication, Newcastle University (1983).Google Scholar
  5. [5]
    F. W. Burton, "Annotations to Control Communication and Synchronisation in the Distributed Evaluation of Functional Programs", University of Colorado, Denver (June 1983).Google Scholar
  6. [6]
    J. Darlington and M. Reeve, "Alice — A Multi-Processor Reduction Machine for the Parallel Evaluation of Applicative Languages" in Proceedings 1981 Conference on Functional Languages and Computer Architecture, Wentworth-by-the-Sea, Porthmouth, New Hampshire (October 1981).Google Scholar
  7. [7]
    E. W. Dijkstra, L. Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens, "On-the-Fly Garbage Collection: an Exercise in Cooperation", Communications of the ACM, Vol. 21 no. 11, pp. 966–975 (November 1978).Google Scholar
  8. [8]
    D. P. Friedman and D. S. Wise, "Reference Counting Can Manage the Circular Invironments of Mutual Recursion", Information Processing Letters, Vol. 8 no. 1, pp. 41–44 (January 1979).Google Scholar
  9. [9]
    P. Hudak and R. M. Keller, "Garbage Collection and Task Deletion in Distributed Applicative Processing Systems", pp. 168–178 in Proceedings of the ACM Symposium on Lisp and Functional Programming, Pittsburgh (August 1982).Google Scholar
  10. [10]
    P. Hudak, "Distributed Task and Memory Management", pp. 277–289 in Proceedings of the ACM Symposium on Principles of Distributed Computing (August 1983).Google Scholar
  11. [11]
    P. Hudak, "Distributed Graph Marking", Research Report 268, Yale University (January 1983).Google Scholar
  12. [12]
    R. J. M. Hughes, "Reference Counting with Circular Structures in Virtual Memory Applicative Systems", Oxford University (1983).Google Scholar
  13. [13]
    Inmos, "IMS T424 transputer, advance information", 1983.Google Scholar
  14. [14]
    H. T. Kung and S. W. Song, "An Efficient Parallel Garbage Collection System and its Correctness Proof", Carnegie-Mellon University, Pittsburgh (September 1977).Google Scholar
  15. [15]
    L. Lamport, "Clocks and the Ordering of Events in a Distributed System", Communications of the ACM, Vol. 21 no. 7, pp. 558–565 (1978).Google Scholar
  16. [16]
    H. Lieberman and C. Hewitt, "A Real-Time Garbage Collector Based on the Life-times of Objects", Communications of the ACM, Vol. 26 no. 6, pp. 419–429 (June 1983).Google Scholar
  17. [17]
    A. K. Nori, "A Storage Reclamation Scheme for Applicative Multiprocessor Systems", University of Utah (December 1979), Master's thesis.Google Scholar
  18. [18]
    S. P. Rana, "A Distributed Solution to the Distributed Termination Problem", Information Processing Letters, Vol. 17, pp. 43–46 (July 1983).Google Scholar
  19. [19]
    G. L. Steele, "Multiprocessing Compactifying Garbage Collection", Communications of the ACM, Vol. 18 no. 9, pp. 495–508 (September 1975).Google Scholar
  20. [20]
    D. S. Wise, Private Communication, Indiana University (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • John Hughes
    • 1
  1. 1.Programming Methodology GroupDepartment of Computer Science Chalmers University of TechnologyGöteborgSweden

Personalised recommendations