Performance week 25/6-29/6
Hi folks, We're planning to attack performance issues next week. I've put up a wiki page here: http://www.haskell.org/hawiki/GhcPerformance We're interested in performance issues with both GHC itself and GHC-compiled code. Please add any programs or modules that you think should compile/run faster, or any hair-brained schemes you have for improving performance. And free free to get involved! If you have anecdotes, information about any of the known issues, or want to tackle something, post here or cvs-ghc@haskell.org, or join the #haskell IRC channel on irc.freenode.net. Cheers, Simon
"Simon Marlow"
We're interested in performance issues with both GHC itself and GHC-compiled code.
I can think of a couple of things. One is the performance of Int64 (which unsurprisingly is inferior to Int(32) but more surprisingly, also to Integer). I've reported it previously, but can dig it up again, if desired. The other is probably not as relevant, but I'll mention it anyway. I occasionally use rather large arrays, and UArrays can save a considerable amount of space. Sometimes, however, I want to store more complex structures than those UArrays are provided for. It seems to me that what I really want are *strict* arrays (which the compiler then can unbox automatically), and that these could be provided for any (single constructor) data type? In general, I find that the speed of GHC-compiled programs is quite adequate, but that space consumption sometimes is excessive. -k -- If I haven't seen further, it is by standing in the footprints of giants
participants (2)
-
Ketil Malde -
Simon Marlow