Name: Anonymous 2009-12-15 9:19
To illustrate the use of [m]par we present a program that performs
two compute intensive functions in parallel. The first compute
intensive function we use is the notorious Fibonacci function:
fib :: Int → Int
b 0 = 0
b 1 = 1
b n = b (n − 1) + b (n − 2)
[1] http://www.haskell.org/~simonmar/papers/threadscope.pdf
two compute intensive functions in parallel. The first compute
intensive function we use is the notorious Fibonacci function:
fib :: Int → Int
b 0 = 0
b 1 = 1
b n = b (n − 1) + b (n − 2)
[1] http://www.haskell.org/~simonmar/papers/threadscope.pdf