Peano
Loading...
Searching...
No Matches
SubcyclingFixedTimeStepWithEnclaveTasking.py
Go to the documentation of this file.
1# This file is part of the ExaHyPE2 project. For conditions of distribution and
2# use, please see the copyright notice at www.peano-framework.org
3from exahype2.solvers.PDETerms import PDETerms
4from exahype2.solvers.fv.EnclaveTasking import EnclaveTasking
5
6import jinja2
7
8from .kernels import create_compute_Riemann_kernel_for_Rusanov
9from .kernels import create_abstract_solver_declarations
10from .kernels import create_abstract_solver_definitions
11from .kernels import create_solver_declarations
12from .kernels import create_solver_definitions
13from .kernels import create_compute_time_step_size_for_fixed_time_stepping_with_subcycling
14
15from .kernels import SolverVariant
16from .kernels import KernelVariant
17
18from exahype2.solvers.fv.kernels import create_halo_layer_construction_with_interpolation_for_reconstructed_patch
19from exahype2.solvers.kernels import create_abstract_solver_user_declarations_for_fixed_time_stepping
20from exahype2.solvers.kernels import create_abstract_solver_user_definitions_for_fixed_time_stepping
21from exahype2.solvers.fv.kernels import create_finish_time_step_implementation_for_fixed_time_stepping
22from exahype2.solvers.fv.kernels import create_start_time_step_implementation_for_fixed_time_stepping_with_subcycling
23
24
26 def __init__(self,
27 name, patch_size, unknowns, auxiliary_variables, min_volume_h, max_volume_h, time_step_size,
28 flux=PDETerms.User_Defined_Implementation,
29 ncp=PDETerms.None_Implementation,
30 eigenvalues=PDETerms.User_Defined_Implementation,
31 boundary_conditions=PDETerms.User_Defined_Implementation,
32 refinement_criterion=PDETerms.Empty_Implementation,
33 initial_conditions=PDETerms.User_Defined_Implementation,
34 source_term=PDETerms.None_Implementation,
35 plot_grid_properties=False,
36 interpolate_linearly_in_time=True,
37 pde_terms_without_state=False, overlap=1
38 ):
39 """
40 time_step_size: Float
41 This is the normalised time step size w.r.t. the coarsest admissible h value. If
42 the code employs AMR on top of it and refines further, it will automatically
43 downscale the time step size accordingly. So hand in a valid time step size w.r.t.
44 to max_volume_h.
45 """
46 self._interpolate_linearly_in_time = interpolate_linearly_in_time
47
48 super(SubcyclingFixedTimeStepWithEnclaveTasking,self).__init__(name,
49 patch_size,
50 overlap,
51 unknowns,
52 auxiliary_variables,
53 min_volume_h,
54 max_volume_h,
55 plot_grid_properties,
56 pde_terms_without_state,
57 kernel_namespace="rusanov")
58 self._time_step_size = time_step_size
59
60 self._flux_implementation_flux_implementation = PDETerms.None_Implementation
61 self._ncp_implementation_ncp_implementation = PDETerms.None_Implementation
64
65 self._compute_time_step_size_compute_time_step_size = create_compute_time_step_size_for_fixed_time_stepping_with_subcycling( time_step_size, name )
66 self._compute_new_time_step_size_compute_new_time_step_size = "const double newTimeStepSize = dt;"
67
69
71 ncp=ncp,
72 eigenvalues=eigenvalues,
73 boundary_conditions=boundary_conditions,
74 refinement_criterion=refinement_criterion,
75 initial_conditions=initial_conditions,
76 source_term=source_term)
77
78
80 flux=None,ncp=None,
81 eigenvalues=None,
82 boundary_conditions=None,refinement_criterion=None,initial_conditions=None,source_term=None,
83 memory_location = None,
84 use_split_loop = False,
85 additional_action_set_includes = "",
86 additional_user_includes = ""
87 ):
88 """
89 If you pass in User_Defined, then the generator will create C++ stubs
90 that you have to befill manually. If you pass in None_Implementation, it
91 will create nop, i.e., no implementation or defaults. Any other string
92 is copied 1:1 into the implementation. If you pass in None, then the
93 set value so far won't be overwritten.
94
95 Please note that not all options are supported by all solvers.
96
97 This routine should be the very last invoked by the constructor.
98 """
99 if flux is not None: self._flux_implementation_flux_implementation = flux
100 if ncp is not None: self._ncp_implementation_ncp_implementation = ncp
101 if eigenvalues is not None: self._eigenvalues_implementation_eigenvalues_implementation = eigenvalues
102 if source_term is not None: self._source_term_implementation_source_term_implementation = source_term
103
104 self._compute_kernel_call_compute_kernel_call = create_compute_Riemann_kernel_for_Rusanov(
108 compute_max_eigenvalue_of_next_time_step = False,
109 solver_variant = SolverVariant.WithVirtualFunctions,
110 kernel_variant = KernelVariant.PatchWiseAoS
111 )
112
113 self._compute_kernel_call_stateless_compute_kernel_call_stateless = create_compute_Riemann_kernel_for_Rusanov(
117 compute_max_eigenvalue_of_next_time_step = False,
118 solver_variant = SolverVariant.Stateless,
119 kernel_variant = KernelVariant.PatchWiseAoS
120 )
121
126 compute_max_eigenvalue_of_next_time_step = False,
127 solver_variant = SolverVariant.Stateless,
128 kernel_variant = KernelVariant.PatchWiseAoS
129 )
130
135 compute_max_eigenvalue_of_next_time_step = False,
136 solver_variant = SolverVariant.Accelerator,
137 kernel_variant = KernelVariant.PatchWiseAoS
138 )
139
141 self._abstract_solver_user_declarations_abstract_solver_user_declarations += create_abstract_solver_user_declarations_for_fixed_time_stepping()
143 self._abstract_solver_user_definitions_abstract_solver_user_definitions += create_abstract_solver_user_definitions_for_fixed_time_stepping()
144
147
148 self._start_time_step_implementation_start_time_step_implementation = create_start_time_step_implementation_for_fixed_time_stepping_with_subcycling(True)
149 self._finish_time_step_implementation_finish_time_step_implementation = create_finish_time_step_implementation_for_fixed_time_stepping(self._time_step_size)
150
151 super(SubcyclingFixedTimeStepWithEnclaveTasking,self).set_implementation(boundary_conditions, refinement_criterion, initial_conditions, memory_location, use_split_loop, additional_action_set_includes, additional_user_includes)
152
153
155 """
156 The actual action sets all are created by the superclass. So nothing
157 is to be done here. But we want to reset the actual updates and
158 projection, and these only happen if we are allowed to update
159 indeed.
160 """
161 super(SubcyclingFixedTimeStepWithEnclaveTasking, self).create_action_sets()
162
163 update_cell_guard = "::exahype2::runTimeStepOnCell( fineGridCell" + self._name_name + "CellLabel, fineGridFaces" + self._name_name + "FaceLabel, repositories::getMinTimeStamp())"
164 #updated_cell_guard = "fineGridCell" + self._name + "CellLabel.getSemaphoreNumber()!=::exahype2::EnclaveBookkeeping::NoEnclaveTaskNumber"
165 self._action_set_update_cell_action_set_update_cell.guard += " and " + update_cell_guard
166 #self._action_set_merge_enclave_task_outcome.guard = updated_cell_guard
167
169 self._action_set_update_cell_action_set_update_cell._Template_TouchCellFirstTime_Fill_Halos = create_halo_layer_construction_with_interpolation_for_reconstructed_patch(self._name_name)
170
171 self._action_set_AMR.event_lifetime = 2*int(self._max_volume_h/self._min_volume_h+1)
172
173
174 @property
176 return super(SubcyclingFixedTimeStepWithEnclaveTasking, self).user_action_set_includes + """
177#include "exahype2/TimeStepping.h"
178#include "exahype2/fv/rusanov/rusanov.h"
179"""
180
181
183 super(SubcyclingFixedTimeStepWithEnclaveTasking, self).create_data_structures()
184
185 self._patch_overlap_old.generator.send_condition = self._patch_overlap_new.generator.send_condition
186 self._patch_overlap_old.generator.receive_and_merge_condition = self._patch_overlap_new.generator.receive_and_merge_condition
Enclave tasking variant of the Finite Volume scheme.
set_implementation(self, boundary_conditions, refinement_criterion, initial_conditions, memory_location, use_split_loop, additional_action_set_includes, additional_user_includes)
If you pass in User_Defined, then the generator will create C++ stubs that you have to befill manuall...
create_data_structures(self)
This routine does not really add new data, but it heavily tailors when data are stored,...
set_implementation(self, flux=None, ncp=None, eigenvalues=None, boundary_conditions=None, refinement_criterion=None, initial_conditions=None, source_term=None, memory_location=None, use_split_loop=False, additional_action_set_includes="", additional_user_includes="")
If you pass in User_Defined, then the generator will create C++ stubs that you have to befill manuall...
user_action_set_includes(self)
Add further includes to this property, if your action sets require some additional routines from othe...
__init__(self, name, patch_size, unknowns, auxiliary_variables, min_volume_h, max_volume_h, time_step_size, flux=PDETerms.User_Defined_Implementation, ncp=PDETerms.None_Implementation, eigenvalues=PDETerms.User_Defined_Implementation, boundary_conditions=PDETerms.User_Defined_Implementation, refinement_criterion=PDETerms.Empty_Implementation, initial_conditions=PDETerms.User_Defined_Implementation, source_term=PDETerms.None_Implementation, plot_grid_properties=False, interpolate_linearly_in_time=True, pde_terms_without_state=False, overlap=1)
time_step_size: Float This is the normalised time step size w.r.t.