to prove that IO and Cont
are monads with satisfing following properties:
join . fmap join = join . joinjoin . fmap return = join . return = idreturn . f
= fmap f . returnjoin . fmap (fmap f) = fmap f . join
Thanks already now,
Burak Ekici
to write.
Your ideas and comments are valuable for me and I would be very appreciated if
you share them.
Thanks a lot and best of regards,
Burak Ekici.
outline_burak.docx
Description: application/vnd.openxmlformats
Dear All,
I am not sure, if the attached files are allowed in the list or not.
Because of this reason, I want to send my outline attached as inline, in any
case.
Thanks already now and best of regards.
Burak Ekici.
OUTLINE
Basically, the objective of this project is to use some objects
Dear List,
I am currently trying to understand the effects
of monads in the sense of parallelisation in
Haskell.
Could somebody please explain the difference
between 'rpar' and 'par'?
I mean, what has been changed after the encapsulation
of 'par' function by Eval monad?
If you asked to
Dear All,
I am trying to parallelize the below Karatsuba multiplication code. However,
at each trial of mine the error message speaking of incorrect indentation
is returned. I could not come up with ideas to solve the problem.
I will be more than glad and appreciated, if any of you sheds light
Excuse me, in the last post I forgot to send the last version of the code
and some some needed functions.
So sorry for spamming.
Here is the code:
import Control.Parallel
import Control.Parallel.Strategies
import Control.DeepSeq
--
type Strategy a = a - Main.Eval a
data Eval a = Done a
Dear List,
I am trying to parallelize RSA encryption and decryption by using below manner,
but when I run executable output file with +RTS -s -N2 command on Windows 7,
output stats say 4 sparks are being created however none of them converted into
real OS threads.
-- SPARKS :4 (0 converted, 4
Latter aslat...@gmail.com wrote:
2011/9/24 Burak Ekici ekcbu...@hotmail.com:
Dear List,
I am trying to parallelize RSA encryption and decryption by using below
manner,
but when I run executable output file with +RTS -s -N2 command on Windows
7,
output stats say 4 sparks are being
Dear List,
I have a point misunderstood!
I am using second generation strategies of Haskell to parallelize some
number of algorithms in Haskell.
The missing point here is that:
In some cases, neither of created sparks are converted into OS threads,
but parallelization happens surprisingly,
Dear List,
I am trying to parallelize Karatsuba multiplication with Haskell's
second generation strategies. Although, I am running the code on an
Intel quad-core CPU, I abnormally have a speedup much greater
than 4, around 10, which means a weird parallelization or something
occurs.
I would
to the increased cache size.
24.12.2011, в 19:49, Burak Ekici ekcbu...@hotmail.com написал(а):
Dear List,
I am trying to parallelize Karatsuba multiplication with Haskell's
second generation strategies. Although, I am running the code on an
Intel quad-core CPU, I abnormally have a speedup much
Hi there,
I was not able to parallelize the below code by parListChunk
strategy. Actually, code works fine without ant mistake in the
result but no improvement in the performance handled.
Threadscope demonstrates that parallelization happens after
the sequential run of the program which is
Dear List,
I am trying to parallelize some number of codes with
using Haskell's original and second generation strategies
in order to be able to compare them.
As far as I understood, in original strategies, ROOT
garbage collection mechanism is used which does
not allow any spark to be pruned.
Dear List,
my question is in which cases, I could understand the speculative
parallelism in parallel Haskell?
Does the case in which all and the same number of created sparks
are converted by both original and second generation strategies,
speak of the speculative parallelism effect? If it does
14 matches
Mail list logo
