Nivia, Don has mentioned most of the documentation about GC work in GHC except for: Generational garbage collection for Haskell - Sansom, Peyton Jones http://citeseer.nj.nec.com/sansom93generational.html There isn't really a paper on the performance of GHC's current generational / compacting collector. I do have one in progress which relates to further work I've been doing on the implementation of the incremental collector. (The incremental collector is not currently available in a GHC release). If you have specific questions feel free to ask and I'll try to answer the to my best ability. What kind of applications are you working with that make them time critical - Do you want to increase user responsiveness and reduce pause times or have the programs run as fast as possible? I'm assuming you want the latter. Have you tried playing with GHC's various tunable GC parameters? Cheers Andy On Sun, 22 Feb 2004, Donald Bruce Stewart wrote:
niviaquental:
Hello, GHC users,
I'm a Computational Engineering student in the University of Pernambuco (Brazil). In my research, I'm working with applications written in Haskell , where time is a critical factor. But there is a pretty high GC overhead I can't understand . Can someone indicate some paper or reference about the GC behaviour in GHC?
Well, I know of a couple:
The workings of the incremental garbage collector: http://research.microsoft.com/~simonpj/Papers/inc-gc.htm
The runtime system document also mentions GC: http://www.haskell.org/ghc/docs/papers/run-time-system.ps.gz
There are probably more references at: http://www.haskell.org/ghc/documentation.html
-- Don _______________________________________________ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
********************************************************************* * Andrew Cheadle email: a.cheadle@doc.ic.ac.uk * * Department of Computing http://www.doc.ic.ac.uk/~amc4/ * * Imperial College * * University of London * *********************************************************************