Don, Thank you for a new tool and great blog post ! I will surely use it. You might be interested by the experiments section of a paper that we submitted to the Haskell Symposium with Simon Marlow and Satnam Singh : http://membres-liglab.imag.fr/termier/HLCM/hlcm.pdf We studied the impact of GC parameters on runtime, on a complex parallel data mining program. We show that correct GC settings are really important for good parallel performance, with a runtimes that can be 5x faster. I think this could interest everyone who want to squeeze up the most of their parallel Haskell programs. Regards, Alexandre -- _____________________________________________________________ Alexandre Termier LIG (Laboratoire d'Informatique de Grenoble) Université Joseph Fourier 681 rue de la Passerelle B.P. 72, 38402 Saint Martin d'Hères (FRANCE) Phone: +33 4 76 82 72 07 Fax: +33 4 76 82 72 87 http://membres-liglab.imag.fr/termier/ _____________________________________________________________ On 06/07/2010 02:46, Don Stewart wrote:
Inspired by a comment by Simon Marlow on Stack Overflow, about the time and space tradeoffs we make with garbage collection, particularly with a generational GCs, I wrote a small program, ghc-gc-tune, to traverse the garbage collector variable space, to see the relationship between settings and program performance. Given a program, it will show you an (optionally interactive) graph of how -A and -H flags to the garbage collector affect performance.
http://donsbot.wordpress.com/2010/07/05/ghc-gc-tune-tuning-haskell-gc-settin...
Feedback and patches welcome!
-- Don _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe