Peano
|
#include <TraversalObserver.h>
Public Types | |
enum class | SendReceiveContext { BoundaryExchange , MultiscaleExchange , ForkDomain , JoinDomain , PeriodicBoundaryDataSwap } |
There are three different scenarios when we merge data: More... | |
Static Public Attributes | |
static constexpr int | NoRebalancing = -1 |
static constexpr int | NoData = -1 |
Can this grid entity hold data. | |
static constexpr int | CreateOrDestroyPersistentGridEntity = -2 |
Implies that the data will then be local or had been local. | |
static constexpr int | CreateOrDestroyHangingGridEntity = -3 |
Implies that the data will then be local or had been local. | |
There is one observer by grid traversal thread and per rank. The observers are generated from the original observer via the clone() operator. Therefore, you never should be required to write a copy constructor. If you run without multithreading but with MPI, you still have to use a SpacetreeSet. The code therefore continues to copy observers.
Definition at line 36 of file TraversalObserver.h.
|
strong |
There are three different scenarios when we merge data:
There are two more modes: join and fork. It is important to note that these differ from the aforementioned modi, as forks and joins are realised as copies. We do not merge existing data structures, but we copy them. As such, the context fork and the context join do arise when we discuss data exchange. They do never arise when we speak about data merges. If you have a case distinction within a merge, those two modi should be left out (or equipped with assertion). They should be never entered.
Enumerator | |
---|---|
BoundaryExchange | |
MultiscaleExchange | |
ForkDomain | |
JoinDomain | |
PeriodicBoundaryDataSwap |
Definition at line 231 of file TraversalObserver.h.
|
virtual |
Definition at line 38 of file TraversalObserver.h.
|
pure virtual |
Begin the traversal.
This routine is called per spacetree instance, i.e. per subtree (thread) per rank. Within the usual implementation, everything will reside on the call stack anyway. If the routine is called on tree no 0, this operation has to establish the master data of the global root tree, i.e. ensure that the data of level -1 is technically there for the subsequent enterCell event, though this data is ill-defined.
x | Root cell coordinates |
h | Root cell size |
Implemented in examples::grid::MyObserver, examples::regulargridupscaling::MyObserver, peano4::grid::EmptyTraversalObserver, and peano4::grid::TraversalVTKPlotter.
Referenced by peano4::grid::Spacetree::traverse().
|
pure virtual |
I use the clone to create one observer object per traversal thread. So between different spacetrees of one spacetree set, there can be no race condition. Yet, the clone() itself could be called in parallel. \section Global per-sweep actions If you want to implement an operation once per sweep in a parallel environment, then you can exploit the fact that the spacetree set also creates an observer for the global master thread, i.e. tree no 0. So if you add a statement alike <pre>
if (peano4::parallel::Node::isGlobalMaster(spacetreeId)) { ... }
then you can be sure that the branch body is executed only once globally per grid sweep.
The counterpart of the clone operation is the destructor.
Implemented in examples::grid::MyObserver, examples::regulargridupscaling::MyObserver, peano4::grid::EmptyTraversalObserver, and peano4::grid::TraversalVTKPlotter.
Referenced by peano4::parallel::SpacetreeSet::createObserverCloneIfRequired().
|
virtual |
Definition at line 247 of file TraversalObserver.h.
|
pure virtual |
Implemented in examples::grid::MyObserver, examples::regulargridupscaling::MyObserver, peano4::grid::EmptyTraversalObserver, and peano4::grid::TraversalVTKPlotter.
Referenced by peano4::grid::Spacetree::traverse().
|
pure virtual |
Event is invoked per cell.
It is however not called for the root cell, i.e. for the cell with level 0 that does not have a parent.
Implemented in peano4::grid::EmptyTraversalObserver, peano4::grid::TraversalVTKPlotter, examples::grid::MyObserver, and examples::regulargridupscaling::MyObserver.
Referenced by peano4::grid::Spacetree::descend().
|
virtual |
Exchange all the data along the domain boundaries.
If the bool is set, we do send out exactly as many elements per face or vertex as we expect to receive. Therefore, the boundary exchange can optimise the data exchange.
The SpacetreeSet class provides some generic routines for this that you can use. Simply invoke them for every data container that you use. If you trigger non-blocking MPI, you don't have to wait until they are finished. You can expect the calling routine that it calls finishAllOutstandingSendsAndReceives() later on.
Definition at line 178 of file TraversalObserver.h.
|
virtual |
Exchange all periodic boundary data.
Periodic boundary values are always handled by tree 0, i.e. there's no need to distinguish ranks here. On all trees that are not rank 0, this operation should immediately return.
Definition at line 185 of file TraversalObserver.h.
Send local data from top level of local mesh to master and receive its top-down information in return.
The SpacetreeSet class provides some generic routines for this that you can use. Simply invoke them for every data container that you use. If you trigger non-blocking MPI, you don't have to wait until they are finished. You can expect the calling routine that it calls finishAllOutstandingSendsAndReceives() later on.
Definition at line 164 of file TraversalObserver.h.
|
virtual |
Wrap up all sends and receives, i.e.
invoke wait() on the MPI requests. The SpacetreeSet provides a generic routine for this that you can call per data container in use.
Definition at line 207 of file TraversalObserver.h.
|
pure virtual |
The tree traversal invokes this operation before beginIteration. \section Content
Dynamic AMR is controlled via a sequence of grid control events. Each event spans a certain region and prescribes an h resolution over this region. Depending on the type of the event (erase or refine), the grid adopts. A simple snippet just creating a refined area in a square is
std::vector< peano4::grid::GridControlEvent > applications4::grid::MyObserver::getGridControlEvents() { std::vector< peano4::grid::GridControlEvent > controlEvents; peano4::grid::GridControlEvent newEvent; newEvent.setRefinementControl( peano4::grid::GridControlEvent::RefinementControl::Refine ); newEvent.setOffset( {0.0,0.0} ); newEvent.setWidth( {0.5,0.5} ); newEvent.setH( {0.05,0.05} ); controlEvents.push_back(newEvent); return controlEvents; }
The entries are logically ordered. The later the entry, the more important it is. So entry 2 overrules entry 1.
Implemented in peano4::grid::EmptyTraversalObserver, and peano4::grid::TraversalVTKPlotter.
Referenced by peano4::grid::Spacetree::traverse().
|
pure virtual |
Implemented in peano4::grid::EmptyTraversalObserver, peano4::grid::TraversalVTKPlotter, examples::grid::MyObserver, and examples::regulargridupscaling::MyObserver.
Referenced by peano4::grid::Spacetree::descend().
|
pure virtual |
Implemented in peano4::grid::EmptyTraversalObserver, and peano4::grid::TraversalVTKPlotter.
Referenced by peano4::grid::Spacetree::descend().
|
virtual |
Definition at line 245 of file TraversalObserver.h.
|
virtual |
Definition at line 244 of file TraversalObserver.h.
Referenced by peano4::grid::Spacetree::receiveAndMergeUserData().
|
virtual |
Definition at line 243 of file TraversalObserver.h.
Referenced by peano4::grid::Spacetree::receiveAndMergeUserData().
|
virtual |
Definition at line 241 of file TraversalObserver.h.
|
virtual |
Definition at line 240 of file TraversalObserver.h.
|
virtual |
Definition at line 239 of file TraversalObserver.h.
|
pure virtual |
Implemented in peano4::grid::EmptyTraversalObserver, and peano4::grid::TraversalVTKPlotter.
Referenced by peano4::grid::Spacetree::descend().
Definition at line 200 of file TraversalObserver.h.
Stream data from current tree on which this routine is called to the new worker.
The SpacetreeSet class provides some generic routines for this that you can use. Simply invoke them for every data container that you use. If you trigger non-blocking MPI, you don't have to wait until they are finished. You can expect the calling routine that it calls finishAllOutstandingSendsAndReceives() later on.
Definition at line 199 of file TraversalObserver.h.
|
staticconstexpr |
Implies that the data will then be local or had been local.
Definition at line 62 of file TraversalObserver.h.
Referenced by peano4::datamanagement::CellMarker::CellMarker(), peano4::grid::GridTraversalEventGenerator::createEnterCellTraversalEvent(), peano4::grid::GridTraversalEventGenerator::createLeaveCellTraversalEvent(), peano4::grid::Spacetree::receiveAndMergeUserData(), and peano4::grid::Spacetree::sendUserData().
|
staticconstexpr |
Implies that the data will then be local or had been local.
Definition at line 57 of file TraversalObserver.h.
Referenced by peano4::datamanagement::CellMarker::CellMarker(), peano4::grid::GridTraversalEventGenerator::createEnterCellTraversalEvent(), peano4::grid::GridTraversalEventGenerator::createLeaveCellTraversalEvent(), peano4::grid::Spacetree::receiveAndMergeUserData(), and peano4::grid::Spacetree::sendUserData().
|
staticconstexpr |
Can this grid entity hold data.
I use this one to indicate that no data is associated with a grid entity, as the grid entity is outside of the local computational domain. The term refers explicitly to the domain decomposition, i.e. this value is used to flag grid entities which are there in the tree, as we always have to work with full trees, but that cannot really hold any data as the user never sees them.
Definition at line 52 of file TraversalObserver.h.
Referenced by peano4::grid::GridTraversalEventGenerator::createEnterCellTraversalEvent(), peano4::grid::GridTraversalEventGenerator::createLeaveCellTraversalEvent(), and peano4::grid::Spacetree::getNeighbourTrees().
|
staticconstexpr |
Definition at line 40 of file TraversalObserver.h.