Re: Mixing lightweight refcount and full GC

2001-11-12 Thread Ken Fox
Michael L Maraist wrote: > No barriers for us? Generational collectors require a write barrier because old objects must never point to younger ones. ('Course Dan said he's starting with a simple copying collector, so we don't need a barrier. Hmm. I guess Dan's not *reject*ing a barrier, just reje

Re: Mixing lightweight refcount and full GC

2001-11-12 Thread Dan Sugalski
At 08:38 PM 11/11/2001 -0500, Michael L Maraist wrote: >I've been very eagerly researching GCing techniques; reading whatever >white-papers I could get my hands on. (mostly linkable via previous posts, >or acm.com) I'm by no means finished, but here's what I've discovered so far: 'Kay, two ques

Re: Mixing lightweight refcount and full GC

2001-11-12 Thread Dan Sugalski
At 05:41 PM 11/11/2001 -0500, Michael G Schwern wrote: >So when a variable is first created, all it has is a single bit >representing it's refcount. When allocated, it's turned on. When it >falls out of scope it's flipped off and swept away. > >When a variable is referenced a second time, it's t

Re: Mixing lightweight refcount and full GC

2001-11-11 Thread Michael L Maraist
On Sunday 11 November 2001 05:41 pm, Michael G Schwern wrote: > While at JAOO, Andy Hunt told me about a little trick Matsumoto is > (was?) trying out for Ruby to speed up it's garbage collection. It > goes something like this (keeping in mind I know very little about GC). > > > Assumtion: Most v