How does one find lazyness bottlenecks?
Fri, 13 Oct 2000 11:49:05 +1100
On 12-Oct-2000, Sengan <firstname.lastname@example.org> wrote:
> Now that ghc 4.08 has a time profiler, I've been improving a program
> I wrote over the last year. However now the GC time dominates the
> execution time (>60%). I can see that my program is not being lazy,
> but I have no idea why.
What makes you think that the GC time is due to insufficient laziness?
My first thought is that high GC times may well be due to the opposite,
too much laziness. Being lazy means that you create closures to represent
unevaluated expressions, and those closures will eventually need to be
Fergus Henderson <email@example.com> | "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh> | of excellence is a lethal habit"
PGP: finger firstname.lastname@example.org | -- the last words of T. S. Garp.