Re: Divide and conquer GC algorithms

On 2011 Nov 12, at 4:31, Jon Harrop wrote:
> gradually refine the granularity.


Absent the intervening degrees of graularity but....
'Tis important to appreciate that, way down at or near each mutation,
reference counting is extremely granular and, therefore, remains
most interesting for supporting parallel processing.
And that is why---in the face of ubiquitous
"But it doesn't work for circular structures" dismissals---it is used every=
 day
by each of us to sustain our persistent file systems (e.g. the Unix HFS).
d
=3D=3D=3D=3D
David S. Wise +1(360)582-9233 ;  fax: +1(360)582-9233   [email protected]=
du
Computer Science Emeritus, Indiana University
                    http://www.cs.indiana.edu/~dswise/