[Haskell-beginners] Performance of parallel mergesort

[Simon Marlow]

On 28/12/09 19:01, Jon Harrop wrote:
> On Monday 28 December 2009 12:56:17 Yitzchak Gale wrote:
>> This discussion definitely does not belong on the
>> Haskell-Beginners list. Besides not being a topic
>> for beginners, being there is keeping it under the
>> radar of many or most of the people who work on
>> these things in Haskell.
>>
>> I am moving the discussion to the GHC users list,
>> as suggested by Antoine. For those joining us in
>> progress, the first part of the thread starts here:
>>
>> http://www.haskell.org/pipermail/beginners/2009-December/003045.html
>
> I am not familiar with the GHC users list but is this discussion about basic
> parallelism really more relevant here? The interesting bits aren't GHC
> specific...

Discussion about support for parallelism in GHC is very on-topic here. 
Parallelism is not part of the Haskell language per se, and although the 
basic par/pseq are not implementation-specific, using them effectively 
may require knowing something about the implementation.  For instance, 
in GHC 6.12 we reduced some overheads and made it possible to 
parallelise some fine-grained parallel problems that previously resulted 
in slowdown on a multicore.

(I'll respond to the particular issues raised in the earlier message 
later, I'm still on holiday right now)

> Also, is this list censored like the Haskell Cafe or is it open?

Haskell lists are only ever moderated on an ad-hoc basis as necessary. 
We've never used moderation on this particular list.

Cheers,
	Simon