This is the mail archive of the
guile@sources.redhat.com
mailing list for the Guile project.
Re: GUILE's GC - why we struggling to solve already solved pr oblems ? (was Re: finding the top of the stack in linux)
- To: Brent Fulgham <brent dot fulgham at xpsystems dot com>
- Subject: Re: GUILE's GC - why we struggling to solve already solved pr oblems ? (was Re: finding the top of the stack in linux)
- From: Jim Blandy <jimb at savonarola dot red-bean dot com>
- Date: 18 Jul 2000 21:43:57 -0500
- Cc: hanwen at cs dot uu dot nl, guile at sourceware dot cygnus dot com
- References: <EDFD2A95EE7DD31187350090279C6767BCB083@THRESHER>
> > > Boehm's GC has A LOT OF things to make efficieng GC in specuial
> > > cases possible. Of course it's not for everyone and thus you must
> > > use some internal functions. Still it's possible (the same
> > > gcj_mlc.c will be good example). Of course it's quite possible then
> > > general-purpose GC still will be less efficient then special-purpose
> > > GUILE's one. There are no way to know without actual try.
> >
> > I'm very interested in seeing the results of an actual try. Would you
> > be willing to try the experiment, and tell us how it goes?
>
> But wasn't that the very experiment han-wen conducted this morning?
Han-wen says that was just a quick-and-dirty try. It slowed down
Guile by 70%, but I'm interested in seeing the result when folks make
proper use of Boehm's stubborn allocation, precise marking, etc.