[Haskell] Pugs gains SMP parallelism support.
taralx at gmail.com
Mon Oct 23 05:12:38 EDT 2006
On 10/23/06, Sebastian Sylvan <sylvan at student.chalmers.se> wrote:
> They probably are. However you get the overhead of creating the array
> (when you don't really need O(1) random access) and every thread
> signals the same semaphore which may lead to some congestion which
> could slow things down.
You do need O(1) random access for the writers to put their results in
efficiently. And newArray_ should be faster than N copies of
newEmptyMVar. It is true that I have one congestion point (the
semaphone) instead of N (the mvars).
Taral <taralx at gmail.com>
"You can't prove anything."
-- Gödel's Incompetence Theorem
More information about the Haskell