|[2 earlier articles]|
|Re: Compiler writers will love this language firstname.lastname@example.org (2003-06-05)|
|Re: Compiler writers will love this language email@example.com (2003-06-08)|
|Re: Compiler writers will love this language firstname.lastname@example.org (2003-06-20)|
|Re: Compiler writers will love this language email@example.com (2003-06-22)|
|Re: Compiler writers will love this language firstname.lastname@example.org (2003-07-02)|
|Re: Storage management, was Compiler writers will love this language email@example.com (2003-07-04)|
|Re: Storage management, was Compiler writers will love this firstname.lastname@example.org (Dobes Vandermeer) (2003-07-13)|
|Re: Storage management, was Compiler writers will love this email@example.com (Dobes Vandermeer) (2003-07-25)|
|From:||Dobes Vandermeer <firstname.lastname@example.org>|
|Date:||13 Jul 2003 23:53:32 -0400|
|References:||03-05-211 03-06-015 03-06-054 03-06-057 03-06-078 03-06-106 03-07-023 03-07-059|
|Posted-Date:||13 Jul 2003 23:53:32 EDT|
> > I really fancy reference-counting is its low overhead,
> Sorry to throw a spanner in your works but reference-counting has a
> _higher_ overhead than mark-and-sweep, just ref-counting spreads this
> overhead through out the entire programme where mark-and-sweep bunches
> the overhead together in a large cluster
There are plenty of papers comparing time & memory overhead -- IIRC
the tracing (mark-and-sweep) collectors tend to use a larger heap
because they keep unreachable garbage around for longer, whereas a
counting collector will deallocate objects as soon as they are
unreachable (if it deallocates them at all); its a tradeoff of space
versus time overhead really.
> > How, by the way, does generational collection deal with circular
> > references? Could the algorithm used be adapted for use in reference
> > counting, to form a sort of new hybrid scheme?
> I seem to remember reading a paper discussing an algorithm to solve
> the circluar reference problem, I cannot seem to find the paper right
> now (was it Lester92?), citeseer.com should help for anyone interested.
Generational Cyclic Reference Counting
Rafael D. Lins
Concurrent Cycle Collection in Reference Counted Systems
David F. Bacon, V.T. Rajan
and you can follow a trail of references from there.
Return to the
Search the comp.compilers archives again.