| 21c688dc | 12-Apr-2016 |
Jed Brown <jed@jedbrown.org> |
SF: delay construction of rank mapping until SF type is set
To implement a shared memory optimization for PetscSF without ugly hacks
that scale poorly, we need to be aware of the shared ranks when
c
SF: delay construction of rank mapping until SF type is set
To implement a shared memory optimization for PetscSF without ugly hacks
that scale poorly, we need to be aware of the shared ranks when
constructing the rank mapping. With eager construction of rank mapping,
this means discarding that or doing fairly complicated and
memory-intense conversion. This commit delays that construction, but
has no further behavioral change.
ex1: explicitly call PetscSFSetUp so that PetscSFView shows the full communication graph.
show more ...
|
| c346545e | 11-Jul-2016 |
Lawrence Mitchell <lawrence.mitchell@imperial.ac.uk> |
PetscSF: Recursively unwrap dupped types
Consider the case where the user passes a dupped type into
PetscSFXXXBegin/End. To find the appropriate data packs, we need to
compare dup(X) and dup(dup(X)
PetscSF: Recursively unwrap dupped types
Consider the case where the user passes a dupped type into
PetscSFXXXBegin/End. To find the appropriate data packs, we need to
compare dup(X) and dup(dup(X)). Previously, MPIPetsc_Type_unwrap would
remove one layer of dupping from the type. Such that we would end up
with X and dup(X). These do not compare equivalent. Fix this by
unwinding all dup calls in MPIPetsc_Type_unwrap.
show more ...
|