sharing
segment of memory.
regards,
Alex Granovsky
- Original Message -
From: "Gilbert Grosdidier" <gilbert.grosdid...@cern.ch>
To: "Open MPI Users" <us...@open-mpi.org>
Sent: Wednesday, January 05, 2011 11:47 PM
Subject: Re: [OMPI users] Granular lo
Hi Gijsbert,
Thank you for this proposal, I think it could be useful for our LQCD
application,
at least for further evaluations. How could I get to the code, please ?
Thanks in advance for your help, Best, G.
Le 03/01/2011 22:36, Gijsbert Wiesenekker a écrit :
On Oct 2, 2010, at
On Oct 2, 2010, at 10:54 , Gijsbert Wiesenekker wrote:
>
> On Oct 1, 2010, at 23:24 , Gijsbert Wiesenekker wrote:
>
>> I have a large array that is shared between two processes. One process
>> updates array elements randomly, the other process reads array elements
>> randomly. Most of the
On Oct 1, 2010, at 3:24 PM, Gijsbert Wiesenekker wrote:
> I have a large array that is shared between two processes. One process
> updates array elements randomly, the other process reads array elements
> randomly. Most of the time these writes and reads do not overlap.
> The current version of
On Oct 1, 2010, at 23:24 , Gijsbert Wiesenekker wrote:
> I have a large array that is shared between two processes. One process
> updates array elements randomly, the other process reads array elements
> randomly. Most of the time these writes and reads do not overlap.
> The current version of
I have a large array that is shared between two processes. One process updates
array elements randomly, the other process reads array elements randomly. Most
of the time these writes and reads do not overlap.
The current version of the code uses Linux shared memory with NSEMS semaphores.
When
