[gclist] Re: gclist-digest V1 #47

[Richard Jones]

>
>gclist-digest              Wednesday, 1 May 1996       Volume 01 : Number 047
>
>
>----------------------------------------------------------------------
>
>From: David Chase <chase@centerline.com>
>Date: Tue, 30 Apr 96 10:42:54 -0400
>Subject: [gclist] Terminology question, "deferred reference counting"
>
>This came up once before, but I managed to delete/forget the exact 
>conclusions.  There's two modifications to reference counting that
>I (recall, probably in error) seeing called "deferred reference counting".
>
>1. Don't adjust the reference count for updates arising from local-variable 
>operations, as long as it can be inferred that the RC is positive 
>when it should be positive.
>
>2. When freeing objects, instead of recursively decrementing and 
>freeing an entire data structure, queue/stack those objects with 
>reference count of zero and process the queue incrementally.
>

The first is deferred reference counting a la Deutsch and Bobrow.

The second I call lazy freeing. It's due to Weizenbaum.

Here are the references

@article{deut76,
author = "L. Peter Deutsch and Daniel G. Bobrow",
title = "An Efficient Incremental Automatic Garbage Collector",
journal = CACM,
publisher = ACM,
volume = 19,
number = 7,
month = jul,
year = 1976,
pages = "522--5226"
}

@article{weiz63,
author = "J. Weizenbaum",
title = "Symmetric List Processor",
journal = CACM,
publisher = ACM,
volume = 6,
number = 9,
month = sep,
year = 1963,
pages = "524--544"
}






  

Richard Jones

===============================================================================

Computing Laboratory                           Room SW107
University of Kent at Canterbury               Telephone: 01227 764000 ext.7943
Canterbury,                                               01227 827943 (direct)
CT2 7NF, U.K.                                  FAX: 01227 762811

===============================================================================