| bf39f1bf | 13-Aug-2017 |
Jed Brown <jed@jedbrown.org> |
SFBasic: pack into non-contiguous (by rank) root/leaf buffers instead of contiguous buffer
This is in preparation for self and shared memory communication, for
which packed leaf and root data may us
SFBasic: pack into non-contiguous (by rank) root/leaf buffers instead of contiguous buffer
This is in preparation for self and shared memory communication, for
which packed leaf and root data may use a common buffer. In that case,
a single contiguous buffer for root and another for leaf data is not
workable.
show more ...
|
| 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 ...
|