Benchmarks Game

This is for entries to The Computer Language Benchmarks Game (Formerly known as The Great Language Shootout). You can see the current Haskell results.

Haskell entries compared to C on the quad core, Feb 2009

Parallel implementations

New implementations written for parallelism. You should almost certainly be working on these only:

• /Parallel

Submitting guide

Now that GHC 6.10 is installed on the Benchmarks Game servers, please make full use of it! There is an immediate need for a complete revamp of all the entries to fix and optimise them for this version of GHC. Please pick a program and contribute!

GHC 6.10 gave us the option of

• parallel garbage collector

GHC 6.8 gave us the option of

• `par`
• SMP runtime
• new regex libs
• lots of other stuff

GHC 6.6 gave the option of using:

• Data.ByteString
• Text.Regex.*
• bang patterns

which should greatly improve clarity and brevity. Line count is not significant now (code is gzipped to determine size), so aim for maximum clarity.

Suggested best practices for submitting an entry to the Benchmarks Game include:

• Posting the proposed code to the community to allow for a best of breed entry. Proposed code is here on the wiki and often in the Haskell-cafe mailing list. This has already helped improve the submitted code.

• Provide complete performance measurements against the current best entry.

• Creating clean, functional-style code or fast, imperative-style code. There are multiple versions ("GHC", "GHC#2", "GHC#3", "GHC#4") of GHC codes on many of the benchmarks with no clear rational for the different versions. It'd be better to have entries for "GHC" be clean, short, functional code and entries for "GHC-#2" be fastest, probably-ugliest code.

• When you submit via the trac system, record in the wiki section for that entry a link to the submission.

• Check for gzip file size before you submit -- lots of points to be had there.

• Try different compile options and the other ideas on the Performance/GHC page.

--
-- The Computer Language Benchmarks Game, http://benchmarksgame.alioth.debian.org/
-- Haskell Benchmarks Game entries, http://www.haskell.org/haskellwiki/Benchmarks_Game
-- 
-- Simon Marlow
-- Shortened by Don Stewart
--

Results

Haskell results for all benchmarks: Gentoo/P4 and Debian/AMD Sempron

Old Single Core Benchmarks

• Binary trees - for Gentoo/P4, Debian/AMD Sempron

• Thread-ring - for Gentoo/P4, Debian/AMD Sempron

• Fannkuch-redux - for Gentoo/P4, Debian/AMD Sempron

• Fasta - for Gentoo/P4, Debian/AMD Sempron

• K-nucleotide - for Gentoo/P4, Debian/AMD Sempron

• Mandelbrot - for Gentoo/P4 , Sempron

• N-body - for Gentoo/P4 , Debian/AMD Sempron

• Pidigits - for Gentoo/P4 , Debian/AMD Sempron

• Regex DNA - for Gentoo/P4, Debian/AMD Sempron

• Reverse complement - for Gentoo/P4, Debian/AMD Sempron

• Spectral - for Gentoo/P4, Debian/AMD Sempron

Todo

The current benchmarks can highlight weak spots in libraries and compilers that need improving. Some things noticed included:

• hashtable performance is poor. A simple binding to a basic C hashtable would be very useful
• it would be nice to have tre regexes in the core libs (instead of POSIX ones)

Why tre regexes? The libtre code is buggy, though if the shootout avoids the bugs then I guess one might want to use it. Would libpcre be a better choice?--ChrisKuklewicz 00:21, 24 February 2009 (UTC)

Obsolete benchmarks

• Takfp

• Ack

• Harmonic

• Healthcare

• N-sieve

• N-sieve Bits

• Partial sums

• Cheap concurrency

• Chameneos

• Random

• Recursive

• SumFile