This is the mail archive of the
mailing list for the GCC project.
Re: Faster compilation speed
- From: Jeff Sturm <jsturm at one-point dot com>
- To: "David S. Miller" <davem at redhat dot com>
- Cc: fjh at cs dot mu dot OZ dot AU, <rittle at latour dot rsch dot comm dot mot dot com>, <gcc at gcc dot gnu dot org>
- Date: Wed, 14 Aug 2002 10:58:38 -0400 (EDT)
- Subject: Re: Faster compilation speed
On Tue, 13 Aug 2002, David S. Miller wrote:
> I think this would be a very interesting experiment.
> Feel free to even try it with an infinitely fast GC, even
> one that executed in zero time.
> Because for the millionth time, it's not the performance of GC itself.
> It's the temporal and spatial locality problems of data accesses which
> is a fundamental result of using GC for memory allocation.
Relax. Earlier in this thread I seem to remember you were advocating
certain experiments in spite of the skeptics. So give the GC experts a
As I understand it, generational collection ought to improve locality,
since the youngest generation can be collected frequently, and may even be
small enough to fit mostly in cache.
(I've never observed it to work in practice, but don't let that
discourage anyone :-)