[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Parallel and Large Results
From: |
Olaf Till |
Subject: |
Re: Parallel and Large Results |
Date: |
Fri, 21 Feb 2014 20:29:04 +0100 |
User-agent: |
Mutt/1.5.21 (2010-09-15) |
On Thu, Feb 20, 2014 at 08:01:01PM +0000, Alberto Simões wrote:
> Hello
>
> I am trying to use parallel package, namely the parcellfun function.
>
> I was able to make it work, but given that each iteration result is a huge
> cell with matrices (about 20 MB each), my machine gets out of memory before
> all processes finish their work.
>
> What I need is a way to "reduce" results during the parallelism (and not
> just at the end). These matrices should be all summed up later, so the
> reduce algorithm is associative, and therefore, I can do it whenever I like.
I don't understand. Could you explain in more detail?
> The problem is that I do not see a way to do that. I tried to do something
> stupid, creating a global cell, and making each process change it. But as
> you might guess, the global cell is not copied to the forked octaves.
"For the protocol", globals defined before forking should of course be
present in each forked octave, but are separate copies and not a
variable shared by the processes.
Olaf
--
public key id EAFE0591, e.g. on x-hkp://pool.sks-keyservers.net
signature.asc
Description: Digital signature