This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Boehm-gc performance data
- From: "Steven Bosscher" <stevenb dot gcc at gmail dot com>
- To: "Laurynas Biveinis" <laurynas dot biveinis at gmail dot com>
- Cc: "Daniel Berlin" <dberlin at dberlin dot org>, gcc at gcc dot gnu dot org
- Date: Fri, 23 Jun 2006 19:08:31 +0200
- Subject: Re: Boehm-gc performance data
- References: <d1e3ff2b0606230851n22821fdt@mail.gmail.com>
On 6/23/06, Laurynas Biveinis <laurynas.biveinis@gmail.com> wrote:
All in all, IMHO this data favours against Boehm's GC in GCC. But
before deciding I would like to enable generational GC features, if
that will help with run time. On the other hand, I don't see how peak
memory usage could be reduced.
What do you think?
First of all, I think I'm impressed by how quickly you've done all this.
Don't write off Boehm's GC just yet. You can't expect to beat
something that has seen a lot of tuning for GCC with something that
you got working only a few days ago. There are a lot of special tricks
especially in ggc-page that may put it at an advantage, but with some
tuning perhaps you can get Boehm's to perform better for GCC.
For the locality thing: Have you already tried using something like
cachegrind or oprofile to compare the cache behavior of gcc with
Boehm's and gcc with ggc? What about allocation strategies? Perhaps
that's another thing you could toy with to improve the peak memory
usage issue. I don't know how Boehm's GC works, but in ggc-page e.g.
all binary expression 'tree's are allocated on the same bag of pages,
which may help (or not, dunno).
Keep up the good work!
Gr.
Steven