Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^8: GHC shuffle more efficient than Perl5.

by audreyt (Hermit)
on Apr 23, 2005 at 15:00 UTC ( #450719=note: print w/ replies, xml ) Need Help??


in reply to Re^7: GHC shuffle more efficient than Perl5.
in thread Why is the execution order of subexpressions undefined?

Well, the trick is you can go into and out of STM monad from the IO monad at any time, since STM is essentially a subset of IO. So you enter STM when concurrent atomicity is required, and do the real IO (say, writing to screen) outside it.

But it is true that, although STM can automatically scale over SMP settings, it still assume essentially a shared memory model; that is why it's called a concurrency tool instead of a (cross-machine) parallelizing tool, which has other fault-tolerance factors to consider.

However, for its targetted use (that is, a compelling replacement over select loops and thread locks/semaphores), STM is still damn useful.


Comment on Re^8: GHC shuffle more efficient than Perl5.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://450719]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (12)
As of 2014-10-24 12:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (131 votes), past polls