[jhc] Re: [Haskell] ANNOUNCE: jhc 0.6.0 Haskell Compiler
lists at qseep.net
Mon Mar 23 12:57:57 EDT 2009
Those are impressive results. Typically on programming language benchmarks,
the speed of ghc-generated code fares well against C, sometimes
outperforming it, at best being 20x faster, at worst being 3x slower. Since
it already seems "fast enough", I'm astonished that jhc could make it even
Where ghc-generated code fares poorly against other languages is memory
usage. Has there been an effort in jhc to reduce the memory footprint of
generated code? How does it fare against ghc in this area?
On Mon, Mar 23, 2009 at 1:09 AM, John Meacham <john at repetae.net> wrote:
> On Mon, Mar 23, 2009 at 08:40:02AM +0100, Ketil Malde wrote:
> > > I had done that, actually, before even my first post, and knew that it
> > > changes little to the picture, at least on my system.
> > I think Bulat was right on the money here: you're essentially testing
> > the efficiency of writing integers. Presumably, JHC is better than
> > GHC at specializing/inlining this library function.
> Indeed, but isn't being better at specializing/inlining exactly what an
> optimizing compiler should do. :)
> In any case, these results are not atypical, generally, if jhc can
> compile something, it ends up being 2-3x faster than ghc. After all,
> C-comparable (or even superior) speed is the main goal of jhc
> development. And if anything, I am more convinced than when I started
> that the goal is achievable. With jhc today, C comparable performance
> from numerical code is not difficult to achieve with some attention to
> strictness annotations.
> John Meacham - ⑆repetae.net⑆john⑈
> Haskell mailing list
> Haskell at haskell.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the jhc