Thanks for the link; that helped me read the pmap code properly. So
it's not a single thread but n that get initially started, and, if the
consumer keeps up, pmap will start a thread when a result value is
taken, this staying ahead with max cpu usage. If I understand this
correctly, it's the (drop
Dear all,
thanks for help and pointers.
Introduction of independent range instead of partitioned parts of lazy
sequence helped achieve parallelism (tested and works 4x faster (4 cores)
then normal version).
Here is the code (modified parts in bold):
(def range-end 2)
(def is-dividable
I think you'll find http://blip.tv/file/4645227 relevant to the subject. I
shows the inner working of pmap.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members
> does access to
> lets say second part of partitioned range cause first part to be
> materialized or no?
Yes, it does.
> My second question is connected to first. If we have 4 cores and *pmap *starts
> 4 threads to perform our function on 4 parts of partitioned range, is this
> happening in para
