Charm++ parallel programming system

[Nicolas Bock <nicolasbock AT gmail.com>]

Hi Jonathan,

In every iteration of the code, I manipulate a chare array inside the reduction of another chare array by insert()'ing or ckDestroy()'ing array elements. My thinking was that I probably should not insert or destroy elements that already exist, or were destroyed in a previous iteration, respectively. If I can't directly inquire the array whether an element exists or not, then I need to use an auxiliary bool array to keep track, which is somewhat cumbersome because this array needs to be sent around in the reduction calls, and then brought back to the caller for the next iteration.

Thanks,

nick

On Mon, Aug 26, 2013 at 10:55 PM, Jonathan Lifflander <jliffl2 AT illinois.edu> wrote:

Depending on what features you are using, existence may be a very
transient properly! For instance, if you call ckDelete() on the
element, but it has not arrived, what would you expect the output to
be?

Can you possibly give more details about your use case?

Jonathan

On Mon, Aug 26, 2013 at 10:44 PM, Nicolas Bock <nicolasbock AT gmail.com> wrote:
> Hi,
>
> is it possible to inquire a chare array to test whether a particular array
> element exists or not? Something like
>
> bool ArrayElement::exists (int x, int y, ...);
>
> maybe?
>
> Thanks,
>
> nick
>
>

> _______________________________________________
> charm mailing list
> charm AT cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/charm
>