Reference documentation for deal.II version 9.4.1
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Loading...
Searching...
No Matches
Public Member Functions | Private Attributes | List of all members
RepartitioningPolicyTools::MinimalGranularityPolicy< dim, spacedim > Class Template Reference

#include <deal.II/distributed/repartitioning_policy_tools.h>

Inheritance diagram for RepartitioningPolicyTools::MinimalGranularityPolicy< dim, spacedim >:
[legend]

Public Member Functions

 MinimalGranularityPolicy (const unsigned int n_min_cells)
 
virtual LinearAlgebra::distributed::Vector< double > partition (const Triangulation< dim, spacedim > &tria_in) const override
 

Private Attributes

const unsigned int n_min_cells
 

Subscriptor functionality

Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class.

std::atomic< unsigned intcounter
 
std::map< std::string, unsigned intcounter_map
 
std::vector< std::atomic< bool > * > validity_pointers
 
const std::type_info * object_info
 
void subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
 
void unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const
 
unsigned int n_subscriptions () const
 
template<typename StreamType >
void list_subscribers (StreamType &stream) const
 
void list_subscribers () const
 
template<class Archive >
void serialize (Archive &ar, const unsigned int version)
 
using map_value_type = decltype(counter_map)::value_type
 
using map_iterator = decltype(counter_map)::iterator
 
static std::mutex mutex
 
static ::ExceptionBaseExcInUse (int arg1, std::string arg2, std::string arg3)
 
static ::ExceptionBaseExcNoSubscriber (std::string arg1, std::string arg2)
 
void check_no_subscribers () const noexcept
 

Detailed Description

template<int dim, int spacedim = dim>
class RepartitioningPolicyTools::MinimalGranularityPolicy< dim, spacedim >

A policy that allows to specify a minimal number of cells per process. If a threshold is reached, processes might be left without cells. The cells will be distributed evenly among the remaining processes.

Definition at line 134 of file repartitioning_policy_tools.h.

Constructor & Destructor Documentation

◆ MinimalGranularityPolicy()

template<int dim, int spacedim>
RepartitioningPolicyTools::MinimalGranularityPolicy< dim, spacedim >::MinimalGranularityPolicy ( const unsigned int  n_min_cells)

Constructor taking the minimum number of cells per process.

Definition at line 186 of file repartitioning_policy_tools.cc.

Member Function Documentation

◆ partition()

template<int dim, int spacedim>
LinearAlgebra::distributed::Vector< double > RepartitioningPolicyTools::MinimalGranularityPolicy< dim, spacedim >::partition ( const Triangulation< dim, spacedim > &  tria_coarse_in) const
overridevirtual

Return a vector of the new owners of the active locally owned and ghost cells.

Implements RepartitioningPolicyTools::Base< dim, spacedim >.

Definition at line 195 of file repartitioning_policy_tools.cc.

Member Data Documentation

◆ n_min_cells

template<int dim, int spacedim = dim>
const unsigned int RepartitioningPolicyTools::MinimalGranularityPolicy< dim, spacedim >::n_min_cells
private

Minimum number of cells per process.

Definition at line 149 of file repartitioning_policy_tools.h.


The documentation for this class was generated from the following files: