Difference between revisions of "Concurrency demos"
Jump to navigation
Jump to search
(category parallel) |
|||
| (14 intermediate revisions by 6 users not shown) | |||
| Line 1: | Line 1: | ||
| + | This page collects examples of concurrent and parallel programming in Haskell. |
||
| ⚫ | |||
| ⚫ | |||
| + | == Examples == |
||
| ⚫ | |||
| ⚫ | |||
| + | * [[/Zeta |Riemann's Zeta function approximation]] |
||
| − | == A simple example of parallelism in Haskell == |
||
| + | * [[/Graceful exit|Signal that you want to gracefully exit another thread]] |
||
| + | * [[/Two reader threads|Passing messages across a single chan to two readers]] |
||
| + | * [[Implement a chat server|Chat server - using a single channel for a variable number of readers]] |
||
| + | * [[/Simple producer and consumer|Passing IO events lazily from a producer to a consumer thread]] |
||
| + | == More examples == |
||
| − | This little piece of code computes an approximation of Riemann's zeta function, balancing the work to be done between N threads. |
||
| ⚫ | |||
| − | <haskell> |
||
| ⚫ | |||
| − | import Control.Concurrent |
||
| − | import Control.Concurrent.MVar |
||
| − | import Control.Monad |
||
| − | import Data.Complex |
||
| − | import System.Environment |
||
| + | == Proposed updates == |
||
| − | zetaRange s (x,y) = sum [ (fromIntegral n :+ 0) ** (-s) | n <- [x..y] ] |
||
| + | The base 3.0.3.1 package's Control.Concurrent.QSem and QSemN are not exception safe. The [[SafeConcurrent]] has the proposed replacement code. |
||
| − | cut :: (Integral a) => (a, a) -> a -> [(a, a)] |
||
| − | cut (x,y) n = (x, x + mine - 1) : cut' (x + mine) size (y - mine) |
||
| − | where |
||
| − | (size, modulo) = y `divMod` n |
||
| − | mine = size + modulo |
||
| + | == Other examples == |
||
| − | cut' _ _ 0 = [] |
||
| + | * [[/Haskell-Javascript concurrency|Haskell -> Javascript: Pseudo-concurrent threads in web browser]] |
||
| − | cut' x' size' n' = (x', x' + size' - 1) : cut' (x' + size') size' (n' - size') |
||
| + | [[Category:Parallel]] |
||
| − | getParams :: IO (Int, Int, Complex Double) |
||
| ⚫ | |||
| − | getParams = do |
||
| ⚫ | |||
| − | argv <- getArgs |
||
| − | case argv of |
||
| − | (t:n:s:[]) -> return (read t, read n, read s) |
||
| − | _ -> error "usage: zeta <nthreads> <boundary> <s>" |
||
| − | |||
| − | main :: IO () |
||
| − | main = do |
||
| − | (t, n, s) <- getParams |
||
| − | childs <- zipWithM thread (repeat s) (cut (1, n) t) |
||
| − | results <- mapM takeMVar childs |
||
| − | print (sum results) |
||
| − | where |
||
| − | thread s range = do |
||
| − | putStrLn ("Starting thread for range " ++ show range) |
||
| − | mvar <- newEmptyMVar |
||
| − | forkIO (putMVar mvar (zetaRange s range)) |
||
| − | return mvar |
||
| − | </haskell> |
||
Latest revision as of 16:18, 16 March 2011
This page collects examples of concurrent and parallel programming in Haskell.
Examples
- Riemann's Zeta function approximation
- Signal that you want to gracefully exit another thread
- Passing messages across a single chan to two readers
- Chat server - using a single channel for a variable number of readers
- Passing IO events lazily from a producer to a consumer thread
More examples
A large range of small demonstration programs for using concurrent and
parallel Haskell are in the Haskell concurrency regression tests. In particular, they show the use of MVars and forkIO.
Proposed updates
The base 3.0.3.1 package's Control.Concurrent.QSem and QSemN are not exception safe. The SafeConcurrent has the proposed replacement code.