Concurrency
Taral
taralx at gmail.com
Mon Apr 3 09:14:12 EDT 2006
On 4/3/06, John Meacham <john at repetae.net> wrote:
> the tasks for which state-threads work well for are IO bound
> multiplexing tasks, pthreads are better for CPU-bound tasks.
Why not make this explicit?
forkCPU :: IO () -> IO ()
On systems incapable of preemption, forkCPU = id. The semantics of
forkCPU is that the computation involved in the argument is
time-consuming and should not block other computations if possible.
--
Taral <taralx at gmail.com>
"You can't prove anything."
-- Gödel's Incompetence Theorem
More information about the Haskell-prime
mailing list