Parallel/Glossary: Difference between revisions
< Parallel
m (→S-Z) |
m (→A-H) |
||
Line 2: | Line 2: | ||
; bound thread | ; bound thread | ||
: A bound thread is a haskell thread that is bound to an operating system thread. While the bound thread is still scheduled by the Haskell run-time system, the operating system thread takes care of all the foreign calls made by the bound thread. All foreign exported functions are run in a bound thread (bound to the OS thread that called the function). Also, the main action of every Haskell program is run in a bound thread. | |||
; concurrency | ; concurrency | ||
Line 12: | Line 13: | ||
: A Haskell thread is a thread of execution for IO code. Multiple Haskell threads can execute IO code concurrently and they can communicate using shared mutable variables and channels. | : A Haskell thread is a thread of execution for IO code. Multiple Haskell threads can execute IO code concurrently and they can communicate using shared mutable variables and channels. | ||
: ''see spark (vs threads)'' | : ''see spark (vs threads)'' | ||
: ''see Haskell thread (vs OS thread)'' | |||
; Haskell thread (vs OS thread) | |||
== I-M == | == I-M == |
Revision as of 10:11, 20 April 2011
A-H
- bound thread
- A bound thread is a haskell thread that is bound to an operating system thread. While the bound thread is still scheduled by the Haskell run-time system, the operating system thread takes care of all the foreign calls made by the bound thread. All foreign exported functions are run in a bound thread (bound to the OS thread that called the function). Also, the main action of every Haskell program is run in a bound thread.
- concurrency
- distributed
- distributed memory model
- Haskell thread
- A Haskell thread is a thread of execution for IO code. Multiple Haskell threads can execute IO code concurrently and they can communicate using shared mutable variables and channels.
- see spark (vs threads)
- see Haskell thread (vs OS thread)
- Haskell thread (vs OS thread)
I-M
N-R
- parallelism
- parallelism (vs concurrency)
S-Z
- shared memory model
- spark
- Sparks are specific to parallel Haskell. Abstractly, a spark is a pure computation which may be evaluated in parallel. Sparks are introduced with the par combinator; the expression (
x `par` y
) "sparks off"x
, telling the runtime that it may evaluate the value ofx
in parallel to other work. Whether or not a spark is evaluated in parallel with other computations, or other Haskell IO threads, depends on what your hardware supports and on how your program is written. Sparks are put in a work queue and when a CPU core is idle, it can execute a spark by taking one from the work queue and evaluating it. - see spark (vs thread)
- spark (vs thread)
- On a multi-core machine, both threads and sparks can be used to achieve parallelism. Threads give you concurrent, non-deterministic parallelism, while sparks give you pure deterministic parallelism. Haskell threads are ideal for applications like network servers where you need to do lots of I/O and using concurrency fits the nature of the problem. Sparks are ideal for speeding up pure calculations where adding non-deterministic concurrency would just make things more complicated.
- STM
- OS thread
- thread
- see Haskell thread, OS thread and bound thread