On 10/23/06, Sebastian Sylvan <[EMAIL PROTECTED]> 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 <[EMAIL PROTECTED]> "You can't prove anything." -- Gödel's Incompetence Theorem _______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
