Advanced Charm++ array creation with a map using an unstructured grid.
Note that to help with performance, it is not advised to do heavy computations in the overridden member functions, procNum() and populateInitial(), since they can be potentially called many times. See also this note on the inner workings of the Charm++ runtime system regarding map objects and array element creation from long-time Charm++ developer, Eric Bohm, also at: http:/
Procnum will be called to construct your chare, the first time a message is sent to it from a node, and each time subsequent sends do not find a precached location record for it. The latter event can occur when many sends have pushed it out of cache, or after migration.
The potential global memory footprint of location management caching is proportional to the total number of objects multiplied by the number of nodes. Therefore, the runtime system keeps a finite number on each node. At the limit, procnum could be called for nearly every message send, therefore procnum should be designed to be inexpensive.
The heavy portion of array element placement should therefore be done in the constructor.
- namespace tk
- Toolkit declarations and definitions for general purpose utilities.
- class tk::UnsMeshMap
- Charm++ array map for initial placement of array elements using an unstructured grid.