Difference between revisions of "Talk:Parallelism vs. Concurrency"
Jump to navigation
Jump to search
m (Observations clarified) |
m (Minor changes to text) |
||
Line 1: | Line 1: | ||
=== Parallelism vs concurrency: what's the difference? === |
=== Parallelism vs concurrency: what's the difference? === |
||
− | '''''Visible'' side effects |
+ | '''''Visible'' side effects:''' |
* Have a look at this <del>ugly eysore</del> "prototype definition" of <code>par</code>: |
* Have a look at this <del>ugly eysore</del> "prototype definition" of <code>par</code>: |
||
Line 29: | Line 29: | ||
# Some time later, <code>forkIO</code>'s argument is called, causing <code>evaluate</code> to start evaluating <code>x</code>. |
# Some time later, <code>forkIO</code>'s argument is called, causing <code>evaluate</code> to start evaluating <code>x</code>. |
||
− | If <code>y</code> is still being evaluated when the evaluation of <code>x</code> commences, then we have concurrency, but with no visible side-effects - elementary parallelism. |
+ | If <code>y</code> is still being evaluated when the evaluation of <code>x</code> commences, then we have concurrency, but with no visible side-effects - it behaves like elementary parallelism. |
|} |
|} |
||
Line 59: | Line 59: | ||
# Some time later, the implementation discovers that a <code>ThreadId</code> has been attached to <code>t</code> and uses the <code>ThreadId</code> to immediately start a new thread for evaluating <code>t</code>; |
# Some time later, the implementation discovers that a <code>ThreadId</code> has been attached to <code>t</code> and uses the <code>ThreadId</code> to immediately start a new thread for evaluating <code>t</code>; |
||
− | This is parallelism, but having visible side effects - it |
+ | This is parallelism, but having visible side effects - it behaves like elementary concurrency. |
|} |
|} |
||
− | Can either |
+ | Can either prototype definition potentially go mainstream? |
* As shown by it's type signature, <code>par</code> is supposed to be pure: avoiding the use of <code>unsafeLocalState</code> means making it primitive; |
* As shown by it's type signature, <code>par</code> is supposed to be pure: avoiding the use of <code>unsafeLocalState</code> means making it primitive; |
||
* While the use of <code>unsafeInterleaveIO</code> may annoy some, it being one of the earlier Haskell extensions means it's widely available. |
* While the use of <code>unsafeInterleaveIO</code> may annoy some, it being one of the earlier Haskell extensions means it's widely available. |
Revision as of 20:56, 4 October 2021
Parallelism vs concurrency: what's the difference?
Visible side effects:
- Have a look at this
ugly eysore"prototype definition" ofpar
:
par :: a -> b -> b par x y = case unsafeLocalState (forkIO (evaluate x >> return ())) of !_ -> y
where:
evaluate :: a -> IO a forkIO :: IO () -> IO ThreadId
Assuming:
x
is well-defined (it contains nounsafe...
calls),x
is well-behaved (not throwing exceptions or causing errors);
then:
forkIO
attaches aThreadId
to its argument, adds it to the work-queue and returns the identifier;par
then returnsy
;- Some time later,
forkIO
's argument is called, causingevaluate
to start evaluatingx
.
If
y
is still being evaluated when the evaluation ofx
commences, then we have concurrency, but with no visible side-effects - it behaves like elementary parallelism.
- Now have a look at this
nearly-as-uglyprototype definition forspawnIO
forkIO
:
forkIO :: IO () -> IO ThreadId forkIO act = do t <- unsafeInterleaveIO act case attachThreadId t of Nothing -> itsThreadId t Just i -> par t (return i)
where:
attachThreadId :: a -> IO (Maybe ThreadId) itsThreadId :: a -> IO ThreadId
Assuming:
par
,attachThreadId
anditsThreadId
are primitive,attachThreadId
would returnNothing
if it's argument already has been assigned aThreadId
;
then:
- A new
ThreadId
is assigned to the new (and suspended) valuet
; - evaluating
par t i
causest
to be added to the work-queue by the implementation; - the
ThreadId
fort
is then returned; - Some time later, the implementation discovers that a
ThreadId
has been attached tot
and uses theThreadId
to immediately start a new thread for evaluatingt
;
This is parallelism, but having visible side effects - it behaves like elementary concurrency.
Can either prototype definition potentially go mainstream?
- As shown by it's type signature,
par
is supposed to be pure: avoiding the use ofunsafeLocalState
means making it primitive; - While the use of
unsafeInterleaveIO
may annoy some, it being one of the earlier Haskell extensions means it's widely available.
For now, using a primitive par
(and others) to define forkIO
looks like the simplest option...but if using unsafeInterleaveIO
really does annoy you, how about this:
forkIO :: (OI -> ()) -> OI -> ThreadId forkIO act u = let !(u1:u2:u3:_) = parts u in let t = act u1 in case attachThreadId t u2 of Nothing -> itsThreadId t u3 Just i -> par t i
-- Atravers Tue Apr 20 06:04:10 UTC 2021