#include <MeshPartition.h>

Inheritance diagram for Nektar::SpatialDomains::MeshPartition:

Classes
struct	GraphEdgeProperties

struct	GraphVertexProperties

Public Member Functions
	MeshPartition (const LibUtilities::SessionReaderSharedPtr session, LibUtilities::CommSharedPtr comm, int meshDim, std::map< int, MeshEntity > element, CompositeDescriptor compMap)

virtual	~MeshPartition ()

void	PartitionMesh (int nParts, bool shared=false, bool overlapping=false, int nLocal=0)

void	PrintPartInfo (std::ostream &out)

void	GetElementIDs (const int procid, std::vector< unsigned int > &tmp)

Protected Types
typedef std::vector< unsigned int >	MultiWeight

typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, GraphVertexProperties, boost::property< boost::edge_index_t, unsigned int, GraphEdgeProperties > >	BoostGraph

typedef boost::graph_traits< BoostGraph >::vertex_descriptor	BoostVertex

typedef boost::graph_traits< BoostGraph >::edge_descriptor	BoostEdge

typedef boost::graph_traits< BoostGraph >::edge_iterator	BoostEdgeIterator

typedef boost::graph_traits< BoostGraph >::vertex_iterator	BoostVertexIterator

typedef boost::graph_traits< BoostGraph >::adjacency_iterator	BoostAdjacencyIterator

typedef std::vector< unsigned int >	NumModes

typedef std::map< std::string, NumModes >	NummodesPerField

Protected Member Functions
void	ReadExpansions ()

void	ReadConditions ()

void	WeightElements ()

void	CreateGraph ()

void	PartitionGraph (int nParts, bool overlapping=false)
	Partition the graph. More...

void	CheckPartitions (int nParts, Array< OneD, int > &pPart)

int	CalculateElementWeight (LibUtilities::ShapeType elmtType, bool bndWeight, int na, int nb, int nc)

int	CalculateEdgeWeight (LibUtilities::ShapeType elmtType, int na, int nb, int nc)

virtual void	v_PartitionGraphImpl (int &nVerts, int &nVertConds, Nektar::Array< Nektar::OneD, int > &xadj, Nektar::Array< Nektar::OneD, int > &adjcy, Nektar::Array< Nektar::OneD, int > &vertWgt, Nektar::Array< Nektar::OneD, int > &vertSize, Nektar::Array< Nektar::OneD, int > &edgeWgt, int &nparts, int &volume, Nektar::Array< Nektar::OneD, int > &part)=0

Protected Attributes
LibUtilities::SessionReaderSharedPtr	m_session

LibUtilities::CommSharedPtr	m_comm

int	m_dim

int	m_numFields

std::map< int, MeshEntity >	m_elements

std::map< int, MeshEntity >	m_ghostElmts

CompositeDescriptor	m_compMap

std::map< int, NummodesPerField >	m_expansions

std::map< int, LibUtilities::ShapeType >	m_shape

std::map< std::string, int >	m_fieldNameToId

std::map< int, MultiWeight >	m_vertWeights

std::map< int, MultiWeight >	m_vertBndWeights

std::map< int, MultiWeight >	m_edgeWeights

BoostGraph	m_graph

std::map< int, std::vector< unsigned int > >	m_localPartition

bool	m_weightingRequired

bool	m_weightBnd

bool	m_weightDofs

bool	m_shared

bool	m_parallel

Detailed Description

Definition at line 66 of file MeshPartition.h.

Member Typedef Documentation

◆ BoostAdjacencyIterator

typedef boost::graph_traits<BoostGraph>::adjacency_iterator Nektar::SpatialDomains::MeshPartition::BoostAdjacencyIterator

protected

Definition at line 118 of file MeshPartition.h.

◆ BoostEdge

typedef boost::graph_traits<BoostGraph>::edge_descriptor Nektar::SpatialDomains::MeshPartition::BoostEdge

protected

Definition at line 113 of file MeshPartition.h.

◆ BoostEdgeIterator

typedef boost::graph_traits<BoostGraph>::edge_iterator Nektar::SpatialDomains::MeshPartition::BoostEdgeIterator

protected

Definition at line 114 of file MeshPartition.h.

◆ BoostGraph

typedef boost::adjacency_list< boost::setS, boost::vecS, boost::undirectedS, GraphVertexProperties, boost::property<boost::edge_index_t, unsigned int, GraphEdgeProperties> > Nektar::SpatialDomains::MeshPartition::BoostGraph

protected

Definition at line 110 of file MeshPartition.h.

◆ BoostVertex

typedef boost::graph_traits<BoostGraph>::vertex_descriptor Nektar::SpatialDomains::MeshPartition::BoostVertex

protected

Definition at line 112 of file MeshPartition.h.

◆ BoostVertexIterator

typedef boost::graph_traits<BoostGraph>::vertex_iterator Nektar::SpatialDomains::MeshPartition::BoostVertexIterator

protected

Definition at line 116 of file MeshPartition.h.

◆ MultiWeight

typedef std::vector<unsigned int> Nektar::SpatialDomains::MeshPartition::MultiWeight

protected

Definition at line 86 of file MeshPartition.h.

◆ NumModes

typedef std::vector<unsigned int> Nektar::SpatialDomains::MeshPartition::NumModes

protected

Definition at line 120 of file MeshPartition.h.

◆ NummodesPerField

typedef std::map<std::string, NumModes> Nektar::SpatialDomains::MeshPartition::NummodesPerField

protected

Definition at line 121 of file MeshPartition.h.

Constructor & Destructor Documentation

◆ MeshPartition()

Nektar::SpatialDomains::MeshPartition::MeshPartition	(	const LibUtilities::SessionReaderSharedPtr	session,
		LibUtilities::CommSharedPtr	comm,
		int	meshDim,
		std::map< int, MeshEntity >	element,
		CompositeDescriptor	compMap
	)

Definition at line 76 of file MeshPartition.cpp.

     : m_session(session), m_comm(comm), m_dim(meshDim), m_numFields(0),
       m_elements(element), m_compMap(compMap), m_fieldNameToId(),
       m_weightingRequired(false), m_weightBnd(false), m_weightDofs(false),
       m_parallel(false)
 {
     // leave the meshpartition method of reading expansions and conditions
     ReadConditions();
     ReadExpansions();
  
     for (auto elIt = m_elements.cbegin(); elIt != m_elements.cend();)
     {
         if (elIt->second.ghost)
         {
             m_ghostElmts[elIt->first] = elIt->second;
             elIt                      = m_elements.erase(elIt);
         }
         else
         {
             ++elIt;
         }
     }
 }

References m_elements, m_ghostElmts, ReadConditions(), and ReadExpansions().

◆ ~MeshPartition()

Nektar::SpatialDomains::MeshPartition::~MeshPartition ( )

virtual

Definition at line 103 of file MeshPartition.cpp.

104 {

105 }

Member Function Documentation

◆ CalculateEdgeWeight()

int Nektar::SpatialDomains::MeshPartition::CalculateEdgeWeight	(	LibUtilities::ShapeType	elmtType,
		int	na,
		int	nb,
		int	nc
	)

protected

Calculate the number of modes needed for communication when in partition boundary, to be used as weighting for edges. Since we do not know exactly which face this refers to, assume the max order and quad face (for prisms) as arbitrary choices

Definition at line 926 of file MeshPartition.cpp.

 {
     int weight = 0;
     int n      = std::max(na, std::max(nb, nc));
     switch (elmtType)
     {
         case LibUtilities::eTetrahedron:
             weight = LibUtilities::StdTriData::getNumberOfCoefficients(n, n);
             break;
         case LibUtilities::ePrism:
             weight = LibUtilities::StdQuadData::getNumberOfCoefficients(n, n);
             break;
         case LibUtilities::eHexahedron:
             weight = LibUtilities::StdQuadData::getNumberOfCoefficients(n, n);
             break;
         case LibUtilities::ePyramid:
             weight = LibUtilities::StdQuadData::getNumberOfCoefficients(n, n);
             break;
         case LibUtilities::eQuadrilateral:
         case LibUtilities::eTriangle:
             weight = n;
             break;
         case LibUtilities::eSegment:
             weight = 1;
             break;
         default:
             break;
     }
  
     return weight;
 }

References Nektar::LibUtilities::eHexahedron, Nektar::LibUtilities::ePrism, Nektar::LibUtilities::ePyramid, Nektar::LibUtilities::eQuadrilateral, Nektar::LibUtilities::eSegment, Nektar::LibUtilities::eTetrahedron, Nektar::LibUtilities::eTriangle, Nektar::LibUtilities::StdTriData::getNumberOfCoefficients(), and Nektar::LibUtilities::StdQuadData::getNumberOfCoefficients().

Referenced by WeightElements().

◆ CalculateElementWeight()

int Nektar::SpatialDomains::MeshPartition::CalculateElementWeight	(	LibUtilities::ShapeType	elmtType,
		bool	bndWeight,
		int	na,
		int	nb,
		int	nc
	)

protected

Definition at line 852 of file MeshPartition.cpp.

 {
     int weight = 0;
  
     switch (elmtType)
     {
         case LibUtilities::eTetrahedron:
             weight = bndWeight
                          ? LibUtilities::StdTetData::getNumberOfBndCoefficients(
                                na, nb, nc)
                          : LibUtilities::StdTetData::getNumberOfCoefficients(
                                na, nb, nc);
             break;
         case LibUtilities::ePrism:
             weight =
                 bndWeight
                     ? LibUtilities::StdPrismData::getNumberOfBndCoefficients(
                           na, nb, nc)
                     : LibUtilities::StdPrismData::getNumberOfCoefficients(
                           na, nb, nc);
             break;
         case LibUtilities::eHexahedron:
             weight = bndWeight
                          ? LibUtilities::StdHexData::getNumberOfBndCoefficients(
                                na, nb, nc)
                          : LibUtilities::StdHexData::getNumberOfCoefficients(
                                na, nb, nc);
             break;
         case LibUtilities::ePyramid:
             weight = bndWeight
                          ? LibUtilities::StdPyrData::getNumberOfBndCoefficients(
                                na, nb, nc)
                          : LibUtilities::StdPyrData::getNumberOfCoefficients(
                                na, nb, nc);
             break;
         case LibUtilities::eQuadrilateral:
             weight =
                 bndWeight
                     ? LibUtilities::StdQuadData::getNumberOfBndCoefficients(na,
                                                                             nb)
                     : LibUtilities::StdQuadData::getNumberOfCoefficients(na,
                                                                          nb);
             break;
         case LibUtilities::eTriangle:
             weight =
                 bndWeight
                     ? LibUtilities::StdTriData::getNumberOfBndCoefficients(na,
                                                                            nb)
                     : LibUtilities::StdTriData::getNumberOfCoefficients(na, nb);
             break;
         case LibUtilities::eSegment:
             weight =
                 bndWeight
                     ? LibUtilities::StdSegData::getNumberOfBndCoefficients(na)
                     : LibUtilities::StdSegData::getNumberOfCoefficients(na);
             break;
         case LibUtilities::ePoint:
             weight = 1;
             break;
         default:
             break;
     }
  
     return weight;
 }

Referenced by PrintPartInfo(), and WeightElements().

◆ CheckPartitions()

void Nektar::SpatialDomains::MeshPartition::CheckPartitions	(	int	nParts,
		Array< OneD, int > &	pPart
	)

protected

Definition at line 810 of file MeshPartition.cpp.

 {
     unsigned int i   = 0;
     unsigned int cnt = 0;
     bool valid       = true;
  
     // Check that every process has at least one element assigned
     for (i = 0; i < nParts; ++i)
     {
         cnt = std::count(pPart.begin(), pPart.end(), i);
         if (cnt == 0)
         {
             valid = false;
         }
     }
  
     // If the graph partitioner produced an invalid partition, repartition
     // naively.  Elements are assigned to processes in a round-robin fashion.
     // It is assumed that graph partitioner failure only occurs when the number
     // of elements is approx. the number of processes, so this approach should
     // not be too inefficient communication-wise.
     if (!valid)
     {
         for (i = 0; i < pPart.size(); ++i)
         {
             pPart[i] = i % nParts;
         }
     }
 }

Referenced by PartitionGraph().

◆ CreateGraph()

void Nektar::SpatialDomains::MeshPartition::CreateGraph ( )

protected

Definition at line 509 of file MeshPartition.cpp.

 {
     // Maps edge/face to first mesh element id.
     // On locating second mesh element id, graph edge is created instead.
     std::unordered_map<int, std::vector<int>> vGraphEdges;
     int vcnt = 0;
  
     for (auto &elmt : m_elements)
     {
         auto vert               = boost::add_vertex(m_graph);
         m_graph[vert].id        = elmt.first;
         m_graph[vert].partition = 0;
  
         if (m_weightingRequired)
         {
             m_graph[vert].weight     = m_vertWeights[elmt.second.origId];
             m_graph[vert].bndWeight  = m_vertBndWeights[elmt.second.origId];
             m_graph[vert].edgeWeight = m_edgeWeights[elmt.second.origId];
         }
  
         // Process element entries and add graph edges
         for (auto &eId : elmt.second.list)
         {
             // Look to see if we've examined this edge/face before
             // If so, we've got both graph vertices so add edge
             auto edgeIt = vGraphEdges.find(eId);
             if (edgeIt != vGraphEdges.end())
             {
                 for (auto &iId : edgeIt->second)
                 {
                     BoostEdge e   = boost::add_edge(vcnt, iId, m_graph).first;
                     m_graph[e].id = vcnt;
                 }
                 vGraphEdges[eId].push_back(vcnt);
             }
             else
             {
                 std::vector<int> Id;
                 Id.push_back(vcnt);
                 vGraphEdges[eId] = Id;
             }
         }
  
         // Increment counter for graph vertex id.
         ++vcnt;
     }
  
     // Now process ghost elements.
     for (auto &ghost : m_ghostElmts)
     {
         auto vert               = boost::add_vertex(m_graph);
         m_graph[vert].id        = ghost.first;
         m_graph[vert].partition = -1;
  
         for (auto &facet : ghost.second.list)
         {
             auto edgeIt = vGraphEdges.find(facet);
             if (edgeIt != vGraphEdges.end())
             {
                 for (auto &iId : edgeIt->second)
                 {
                     BoostEdge e   = boost::add_edge(vcnt, iId, m_graph).first;
                     m_graph[e].id = vcnt;
                 }
                 vGraphEdges[facet].push_back(vcnt);
             }
         }
  
         // Increment counter for graph vertex id.
         ++vcnt;
     }
 }

References m_edgeWeights, m_elements, m_ghostElmts, m_graph, m_vertBndWeights, m_vertWeights, and m_weightingRequired.

Referenced by PartitionMesh().

◆ GetElementIDs()

void Nektar::SpatialDomains::MeshPartition::GetElementIDs	(	const int	procid,
		std::vector< unsigned int > &	tmp
	)

Definition at line 840 of file MeshPartition.cpp.

 {
     BoostVertexIterator vertit, vertit_end;
  
     auto it = m_localPartition.find(procid);
  
     ASSERTL0(it != m_localPartition.end(), "Unable to find local partition");
  
     elmtid = m_localPartition[procid];
 }

References ASSERTL0, and m_localPartition.

◆ PartitionGraph()

void Nektar::SpatialDomains::MeshPartition::PartitionGraph	(	int	nParts,
		bool	overlapping = `false`
	)

protected

Partition the graph.

This routine partitions the graph pGraph into nParts, producing subgraphs that are populated in pLocalPartition. If the overlapping option is set (which is used for post-processing purposes), the resulting partitions are extended to cover neighbouring elements by additional vertex on the dual graph, which produces overlapping partitions (i.e. the intersection of two connected partitions is non-empty).

Parameters

nParts	Number of partitions.
pLocalPartition	Vector of sub-graphs representing each
overlapping	True if resulting partitions should overlap.

Definition at line 597 of file MeshPartition.cpp.

 {
     int i;
     int nGraphVerts = boost::num_vertices(m_graph);
     int nGhost      = m_ghostElmts.size();
     int nLocal      = nGraphVerts - nGhost;
  
     int ncon = 1;
     if (m_weightDofs && m_weightBnd)
     {
         ncon = 2;
     }
  
     // Convert boost graph into CSR format
     BoostVertexIterator vertit, vertit_end;
     BoostAdjacencyIterator adjvertit, adjvertit_end;
     Array<OneD, int> part(nGraphVerts, 0);
  
     if (m_comm->GetRowComm()->TreatAsRankZero() || m_parallel)
     {
         int acnt    = 0;
         int vcnt    = 0;
         int nWeight = ncon * nLocal;
  
         Array<OneD, int> xadj(nLocal + 1);
         std::vector<int> adjncy_tmp, adjwgt_tmp;
         Array<OneD, int> vwgt(nWeight, 1);
         Array<OneD, int> vsize(nLocal, 1);
  
         // Initialise starting point of adjacency array.
         xadj[0] = 0;
  
         for (boost::tie(vertit, vertit_end) = boost::vertices(m_graph);
              vertit != vertit_end && vcnt < nLocal; ++vertit)
         {
             for (boost::tie(adjvertit, adjvertit_end) =
                      boost::adjacent_vertices(*vertit, m_graph);
                  adjvertit != adjvertit_end; ++adjvertit, ++acnt)
             {
                 adjncy_tmp.push_back(m_graph[*adjvertit].id);
                 if (m_weightingRequired)
                 {
                     adjwgt_tmp.push_back(m_graph[*vertit].edgeWeight[0]);
                 }
                 else
                 {
                     adjwgt_tmp.push_back(1);
                 }
             }
  
             xadj[++vcnt] = acnt;
  
             if (m_weightingRequired)
             {
                 int ccnt = 0;
                 if (m_weightDofs)
                 {
                     vwgt[ncon * (vcnt - 1) + ccnt] = m_graph[*vertit].weight[0];
                     ccnt++;
                 }
                 if (m_weightBnd)
                 {
                     vwgt[ncon * (vcnt - 1) + ccnt] =
                         m_graph[*vertit].bndWeight[0];
                 }
             }
         }
  
         Array<OneD, int> adjncy(adjncy_tmp.size(), &adjncy_tmp[0]);
         Array<OneD, int> adjwgt(adjwgt_tmp.size(), &adjwgt_tmp[0]);
  
         // Call partitioner to partition graph
         int vol = 0;
  
         try
         {
             //////////////////////////////////////////////////////
             // On a cartesian communicator do mesh partiotion just on the first
             // column
             // so there is no doubt the partitions are all the same in all the
             // columns
             if (m_comm->GetColumnComm()->GetRank() == 0)
             {
                 // Attempt partitioning.
                 v_PartitionGraphImpl(nLocal, ncon, xadj, adjncy, vwgt, vsize,
                                      adjwgt, nParts, vol, part);
  
                 // Check the partitioner produced a valid partition and fix if
                 // not.
                 if (!m_parallel)
                 {
                     CheckPartitions(nParts, part);
                 }
  
                 if (!m_shared)
                 {
                     // distribute among columns
                     for (i = 1; i < m_comm->GetColumnComm()->GetSize(); ++i)
                     {
                         m_comm->GetColumnComm()->Send(i, part);
                     }
                 }
             }
             else
             {
                 m_comm->GetColumnComm()->Recv(0, part);
             }
         }
         catch (...)
         {
             NEKERROR(ErrorUtil::efatal, "Error in calling graph partitioner.");
         }
     }
     else if (!m_parallel)
     {
         m_comm->GetRowComm()->Recv(0, part);
     }
  
     // Create storage for this (and possibly other) process's partitions.
     i = 0;
  
     if (!m_parallel)
     {
         // Populate subgraph(s) for each rank.
         for (boost::tie(vertit, vertit_end) = boost::vertices(m_graph);
              vertit != vertit_end; ++vertit, ++i)
         {
             m_localPartition[part[i]].push_back(m_graph[*vertit].id);
         }
     }
     else
     {
         // Figure out how many vertices we're going to get from each processor.
         int nproc = m_comm->GetSize(), rank = m_comm->GetRank();
         std::vector<int> numToSend(nproc, 0), numToRecv(nproc);
         std::map<int, std::vector<int>> procMap;
  
         for (boost::tie(vertit, vertit_end) = boost::vertices(m_graph);
              vertit != vertit_end && i < nLocal; ++vertit, ++i)
         {
             int toProc = part[i];
             numToSend[toProc]++;
             procMap[toProc].push_back(m_graph[*vertit].id);
         }
  
         m_comm->AlltoAll(numToSend, numToRecv);
  
         // Build offsets for all-to-all communication
         std::vector<int> sendOffsetMap(nproc), recvOffsetMap(nproc);
  
         sendOffsetMap[0] = 0;
         recvOffsetMap[0] = 0;
         for (int i = 1; i < nproc; ++i)
         {
             sendOffsetMap[i] = sendOffsetMap[i - 1] + numToSend[i - 1];
             recvOffsetMap[i] = recvOffsetMap[i - 1] + numToRecv[i - 1];
         }
  
         // Build data to send
         int totalSend = Vmath::Vsum(nproc, &numToSend[0], 1);
         int totalRecv = Vmath::Vsum(nproc, &numToRecv[0], 1);
  
         std::vector<int> sendData(totalSend), recvData(totalRecv);
  
         int cnt = 0;
         for (auto &verts : procMap)
         {
             for (auto &vert : verts.second)
             {
                 sendData[cnt++] = vert;
             }
         }
  
         // Send ID map to processors
         m_comm->AlltoAllv(sendData, numToSend, sendOffsetMap, recvData,
                           numToRecv, recvOffsetMap);
  
         // Finally, populate m_localPartition for this processor. Could contain
         // duplicates so erase those first.
         std::unordered_set<int> uniqueIDs;
         for (auto &id : recvData)
         {
             uniqueIDs.insert(id);
         }
  
         m_localPartition[rank].insert(m_localPartition[rank].begin(),
                                       uniqueIDs.begin(), uniqueIDs.end());
     }
  
     // If the overlapping option is set (for post-processing purposes),
     // add vertices that correspond to the neighbouring elements.
     if (overlapping)
     {
         ASSERTL0(!m_parallel, "Overlapping partitioning not supported in "
                               "parallel execution");
  
         for (boost::tie(vertit, vertit_end) = boost::vertices(m_graph);
              vertit != vertit_end; ++vertit)
         {
             for (boost::tie(adjvertit, adjvertit_end) =
                      boost::adjacent_vertices(*vertit, m_graph);
                  adjvertit != adjvertit_end; ++adjvertit)
             {
                 if (part[*adjvertit] != part[*vertit])
                 {
                     m_localPartition[part[*vertit]].push_back(
                         m_graph[*adjvertit].id);
                 }
             }
         }
     }
 }

References ASSERTL0, CheckPartitions(), Nektar::ErrorUtil::efatal, m_comm, m_ghostElmts, m_graph, m_localPartition, m_parallel, m_shared, m_weightBnd, m_weightDofs, m_weightingRequired, NEKERROR, v_PartitionGraphImpl(), and Vmath::Vsum().

Referenced by PartitionMesh().

◆ PartitionMesh()

void Nektar::SpatialDomains::MeshPartition::PartitionMesh	(	int	nParts,
		bool	shared = `false`,
		bool	overlapping = `false`,
		int	nLocal = `0`
	)

Definition at line 107 of file MeshPartition.cpp.

 {
     boost::ignore_unused(nLocal);
  
     ASSERTL0(m_parallel || m_elements.size() >= nParts,
              "Too few elements for this many processes.");
     m_shared = shared;
  
     ASSERTL0(!m_parallel || shared,
              "Parallel partitioning requires shared filesystem.");
  
     if (m_weightingRequired)
     {
         WeightElements();
     }
     CreateGraph();
  
     PartitionGraph(nParts, overlapping);
 }

References ASSERTL0, CreateGraph(), m_elements, m_parallel, m_shared, m_weightingRequired, PartitionGraph(), and WeightElements().

◆ PrintPartInfo()

void Nektar::SpatialDomains::MeshPartition::PrintPartInfo ( std::ostream & out )

Definition at line 309 of file MeshPartition.cpp.

 {
     int nElmt = boost::num_vertices(m_graph);
     int nPart = m_localPartition.size();
  
     out << "# Partition information:" << std::endl;
     out << "# No. elements  : " << nElmt << std::endl;
     out << "# No. partitions: " << nPart << std::endl;
     out << "# ID  nElmt  nLocDof  nBndDof" << std::endl;
  
     BoostVertexIterator vertit, vertit_end;
     std::vector<int> partElmtCount(nPart, 0);
     std::vector<int> partLocCount(nPart, 0);
     std::vector<int> partBndCount(nPart, 0);
  
     std::map<int, int> elmtSizes;
     std::map<int, int> elmtBndSizes;
  
     for (std::map<int, NummodesPerField>::iterator expIt = m_expansions.begin();
          expIt != m_expansions.end(); ++expIt)
     {
         int elid             = expIt->first;
         NummodesPerField npf = expIt->second;
  
         for (NummodesPerField::iterator it = npf.begin(); it != npf.end(); ++it)
         {
             ASSERTL0(it->second.size() == m_dim,
                      " Number of directional"
                      " modes in expansion spec for element id = " +
                          boost::lexical_cast<std::string>(elid) +
                          " and field " +
                          boost::lexical_cast<std::string>(it->first) +
                          " does not correspond to mesh dimension");
  
             int na = it->second[0];
             int nb = 0;
             int nc = 0;
             if (m_dim >= 2)
             {
                 nb = it->second[1];
             }
             if (m_dim == 3)
             {
                 nc = it->second[2];
             }
  
             elmtSizes[elid] =
                 CalculateElementWeight(m_shape[elid], false, na, nb, nc);
             elmtBndSizes[elid] =
                 CalculateElementWeight(m_shape[elid], true, na, nb, nc);
         }
     }
  
     for (boost::tie(vertit, vertit_end) = boost::vertices(m_graph);
          vertit != vertit_end; ++vertit)
     {
         int partId = m_graph[*vertit].partition;
         partElmtCount[partId]++;
         partLocCount[partId] += elmtSizes[m_graph[*vertit].id];
         partBndCount[partId] += elmtBndSizes[m_graph[*vertit].id];
     }
  
     for (int i = 0; i < nPart; ++i)
     {
         out << i << " " << partElmtCount[i] << " " << partLocCount[i] << " "
             << partBndCount[i] << std::endl;
     }
 }

References ASSERTL0, CalculateElementWeight(), m_dim, m_expansions, m_graph, m_localPartition, and m_shape.

◆ ReadConditions()

void Nektar::SpatialDomains::MeshPartition::ReadConditions ( )

protected

Definition at line 378 of file MeshPartition.cpp.

 {
     if (!m_session->DefinesElement("Nektar/Conditions/SolverInfo"))
     {
         // No SolverInfo = no change of default action to weight
         // mesh graph.
         return;
     }
  
     TiXmlElement *solverInfoElement =
         m_session->GetElement("Nektar/Conditions/SolverInfo");
  
     TiXmlElement *solverInfo = solverInfoElement->FirstChildElement("I");
     ASSERTL0(solverInfo, "Cannot read SolverInfo tags");
  
     while (solverInfo)
     {
         // read the property name
         ASSERTL0(solverInfo->Attribute("PROPERTY"),
                  "Missing PROPERTY attribute in solver info "
                  "section. ");
         std::string solverProperty = solverInfo->Attribute("PROPERTY");
         ASSERTL0(!solverProperty.empty(),
                  "Solver info properties must have a non-empty "
                  "name. ");
         // make sure that solver property is capitalised
         std::string solverPropertyUpper = boost::to_upper_copy(solverProperty);
  
         // read the value
         ASSERTL0(solverInfo->Attribute("VALUE"),
                  "Missing VALUE attribute in solver info section. ");
         std::string solverValue = solverInfo->Attribute("VALUE");
         ASSERTL0(!solverValue.empty(),
                  "Solver info properties must have a non-empty value");
         // make sure that property value is capitalised
         std::string propertyValueUpper = boost::to_upper_copy(solverValue);
  
         if (solverPropertyUpper == "WEIGHTPARTITIONS")
         {
             if (propertyValueUpper == "DOF")
             {
                 m_weightingRequired = true;
                 m_weightDofs        = true;
             }
             else if (propertyValueUpper == "BOUNDARY")
             {
                 m_weightingRequired = true;
                 m_weightBnd         = true;
             }
             else if (propertyValueUpper == "BOTH")
             {
                 m_weightingRequired = true;
                 m_weightDofs        = true;
                 m_weightBnd         = true;
             }
             return;
         }
         solverInfo = solverInfo->NextSiblingElement("I");
     }
 }

References ASSERTL0, m_session, m_weightBnd, m_weightDofs, and m_weightingRequired.

Referenced by MeshPartition().

◆ ReadExpansions()

void Nektar::SpatialDomains::MeshPartition::ReadExpansions ( )

protected

Definition at line 128 of file MeshPartition.cpp.

 {
     // Find the Expansions tag
     TiXmlElement *expansionTypes = m_session->GetElement("Nektar/Expansions");
  
     // Find the Expansion type
     TiXmlElement *expansion = expansionTypes->FirstChildElement();
     std::string expType     = expansion->Value();
  
     // Expansiontypes will contain plenty of data, where relevant at this stage
     // are composite ID(s) that this expansion type describes, nummodes and a
     // list of fields that this expansion relates to. If this does not exist the
     // variable is only set to "DefaultVar".
     if (expType == "E")
     {
         while (expansion)
         {
             std::vector<unsigned int> composite;
             std::vector<unsigned int> nummodes;
             std::vector<std::string> fieldName;
  
             const char *nModesStr = expansion->Attribute("NUMMODES");
             ASSERTL0(nModesStr,
                      "NUMMODES was not defined in EXPANSION section of input");
             std::string numModesStr = nModesStr;
             bool valid =
                 ParseUtils::GenerateVector(numModesStr.c_str(), nummodes);
             ASSERTL0(valid, "Unable to correctly parse the number of modes.");
  
             if (nummodes.size() == 1)
             {
                 for (int i = 1; i < m_dim; i++)
                 {
                     nummodes.push_back(nummodes[0]);
                 }
             }
             ASSERTL0(nummodes.size() == m_dim,
                      "Number of modes should match mesh dimension");
  
             const char *fStr = expansion->Attribute("FIELDS");
             if (fStr)
             {
                 std::string fieldStr = fStr;
                 bool valid =
                     ParseUtils::GenerateVector(fieldStr.c_str(), fieldName);
                 ASSERTL0(valid, "Unable to correctly parse the field string in "
                                 "ExpansionTypes.");
  
                 for (int i = 0; i < fieldName.size(); ++i)
                 {
                     if (m_fieldNameToId.count(fieldName[i]) == 0)
                     {
                         int k                         = m_fieldNameToId.size();
                         m_fieldNameToId[fieldName[i]] = k;
                         m_numFields++;
                     }
                 }
             }
             else
             {
                 fieldName.push_back("DefaultVar");
                 int k = m_fieldNameToId.size();
  
                 if (m_fieldNameToId.count("DefaultVar") == 0)
                 {
                     ASSERTL0(
                         k == 0,
                         "Omitting field variables and explicitly listing "
                         "them in different ExpansionTypes is wrong practise");
  
                     m_fieldNameToId["DefaultVar"] = k;
                     m_numFields++;
                 }
             }
  
             std::string compositeStr = expansion->Attribute("COMPOSITE");
             ASSERTL0(compositeStr.length() > 3,
                      "COMPOSITE must be specified in expansion definition");
             int beg = compositeStr.find_first_of("[");
             int end = compositeStr.find_first_of("]");
             std::string compositeListStr =
                 compositeStr.substr(beg + 1, end - beg - 1);
             bool parseGood = ParseUtils::GenerateSeqVector(
                 compositeListStr.c_str(), composite);
             ASSERTL0(parseGood && !composite.empty(),
                      (std::string("Unable to read composite index range: ") +
                       compositeListStr)
                          .c_str());
  
             // construct mapping (elmt id, field name) -> nummodes
             for (int i = 0; i < composite.size(); ++i)
             {
                 auto &shapeType = m_compMap[composite[i]].first;
                 auto &elmtIds   = m_compMap[composite[i]].second;
  
                 for (int j = 0; j < fieldName.size(); j++)
                 {
                     for (auto &elid : elmtIds)
                     {
                         m_expansions[elid][fieldName[j]] = nummodes;
                         m_shape[elid]                    = shapeType;
                     }
                 }
             }
  
             expansion = expansion->NextSiblingElement("E");
         }
     }
     else if (expType == "F")
     {
         ASSERTL0(expansion->Attribute("FILE"),
                  "Attribute FILE expected for type F expansion");
         std::string filenameStr = expansion->Attribute("FILE");
         ASSERTL0(!filenameStr.empty(),
                  "A filename must be specified for the FILE "
                  "attribute of expansion");
  
         // Create fieldIO object to load file
         //    need a serial communicator to avoid problems with
         //    shared file system
         LibUtilities::CommSharedPtr comm =
             LibUtilities::GetCommFactory().CreateInstance("Serial", 0, 0);
         std::string iofmt =
             LibUtilities::FieldIO::GetFileType(filenameStr, comm);
         LibUtilities::FieldIOSharedPtr f =
             LibUtilities::GetFieldIOFactory().CreateInstance(
                 iofmt, comm, m_session->GetSharedFilesystem());
  
         // Load field definitions from file
         std::vector<LibUtilities::FieldDefinitionsSharedPtr> fielddefs;
         f->Import(filenameStr, fielddefs);
  
         // Parse field definitions
         for (int i = 0; i < fielddefs.size(); ++i)
         {
             // Name of fields
             for (int j = 0; j < fielddefs[i]->m_fields.size(); ++j)
             {
                 std::string fieldName = fielddefs[i]->m_fields[j];
                 if (m_fieldNameToId.count(fieldName) == 0)
                 {
                     int k                      = m_fieldNameToId.size();
                     m_fieldNameToId[fieldName] = k;
                     m_numFields++;
                 }
             }
             // Number of modes and shape for each element
             int numHomoDir = fielddefs[i]->m_numHomogeneousDir;
             int cnt        = 0;
             for (int j = 0; j < fielddefs[i]->m_elementIDs.size(); ++j)
             {
                 int elid = fielddefs[i]->m_elementIDs[j];
                 std::vector<unsigned int> nummodes;
                 for (int k = 0; k < m_dim; k++)
                 {
                     nummodes.push_back(fielddefs[i]->m_numModes[cnt++]);
                 }
                 if (fielddefs[i]->m_uniOrder)
                 {
                     cnt = 0;
                 }
                 else
                 {
                     cnt += numHomoDir;
                 }
                 for (int k = 0; k < fielddefs[i]->m_fields.size(); k++)
                 {
                     std::string fieldName         = fielddefs[i]->m_fields[k];
                     m_expansions[elid][fieldName] = nummodes;
                 }
                 m_shape[elid] = fielddefs[i]->m_shapeType;
             }
         }
     }
     else
     {
         ASSERTL0(false,
                  "Expansion type not defined or not supported at the moment");
     }
 }

References ASSERTL0, Nektar::LibUtilities::NekFactory< tKey, tBase, tParam >::CreateInstance(), Nektar::ParseUtils::GenerateSeqVector(), Nektar::ParseUtils::GenerateVector(), Nektar::LibUtilities::GetCommFactory(), Nektar::LibUtilities::GetFieldIOFactory(), Nektar::LibUtilities::FieldIO::GetFileType(), m_compMap, m_dim, m_expansions, m_fieldNameToId, m_numFields, m_session, and m_shape.

Referenced by MeshPartition().

◆ v_PartitionGraphImpl()

virtual void Nektar::SpatialDomains::MeshPartition::v_PartitionGraphImpl	(	int &	nVerts,
		int &	nVertConds,
		Nektar::Array< Nektar::OneD, int > &	xadj,
		Nektar::Array< Nektar::OneD, int > &	adjcy,
		Nektar::Array< Nektar::OneD, int > &	vertWgt,
		Nektar::Array< Nektar::OneD, int > &	vertSize,
		Nektar::Array< Nektar::OneD, int > &	edgeWgt,
		int &	nparts,
		int &	volume,
		Nektar::Array< Nektar::OneD, int > &	part
	)

protectedpure virtual

Implemented in Nektar::SpatialDomains::MeshPartitionScotch, Nektar::SpatialDomains::MeshPartitionPtScotch, and Nektar::SpatialDomains::MeshPartitionMetis.

Referenced by PartitionGraph().

◆ WeightElements()

void Nektar::SpatialDomains::MeshPartition::WeightElements ( )

protected

Definition at line 453 of file MeshPartition.cpp.

 {
     std::vector<unsigned int> weight(m_numFields, 1);
     std::map<int, MeshEntity>::iterator eIt;
     for (eIt = m_elements.begin(); eIt != m_elements.end(); ++eIt)
     {
         m_vertWeights[eIt->second.origId]    = weight;
         m_vertBndWeights[eIt->second.origId] = weight;
         m_edgeWeights[eIt->second.origId]    = weight;
     }
  
     for (std::map<int, NummodesPerField>::iterator expIt = m_expansions.begin();
          expIt != m_expansions.end(); ++expIt)
     {
         int elid             = expIt->first;
         NummodesPerField npf = expIt->second;
  
         for (NummodesPerField::iterator it = npf.begin(); it != npf.end(); ++it)
         {
             ASSERTL0(it->second.size() == m_dim,
                      " Number of directional"
                      " modes in expansion spec for element id = " +
                          boost::lexical_cast<std::string>(elid) +
                          " and field " +
                          boost::lexical_cast<std::string>(it->first) +
                          " does not correspond to mesh dimension");
  
             int na = it->second[0];
             int nb = 0;
             int nc = 0;
             if (m_dim >= 2)
             {
                 nb = it->second[1];
             }
             if (m_dim == 3)
             {
                 nc = it->second[2];
             }
  
             // Assume for parallel partitioning that this is just missing from
             // our partition.
             if (m_vertWeights.find(elid) == m_vertWeights.end())
             {
                 continue;
             }
  
             m_vertWeights[elid][m_fieldNameToId[it->first]] =
                 CalculateElementWeight(m_shape[elid], false, na, nb, nc);
             m_vertBndWeights[elid][m_fieldNameToId[it->first]] =
                 CalculateElementWeight(m_shape[elid], true, na, nb, nc);
             m_edgeWeights[elid][m_fieldNameToId[it->first]] =
                 CalculateEdgeWeight(m_shape[elid], na, nb, nc);
         }
     } // for i
 }

References ASSERTL0, CalculateEdgeWeight(), CalculateElementWeight(), m_dim, m_edgeWeights, m_elements, m_expansions, m_fieldNameToId, m_numFields, m_shape, m_vertBndWeights, and m_vertWeights.

Referenced by PartitionMesh().

Member Data Documentation

◆ m_comm

LibUtilities::CommSharedPtr Nektar::SpatialDomains::MeshPartition::m_comm

protected

Definition at line 124 of file MeshPartition.h.

Referenced by PartitionGraph(), and Nektar::SpatialDomains::MeshPartitionPtScotch::v_PartitionGraphImpl().

◆ m_compMap

CompositeDescriptor Nektar::SpatialDomains::MeshPartition::m_compMap

protected

Definition at line 131 of file MeshPartition.h.

Referenced by ReadExpansions().

◆ m_dim

int Nektar::SpatialDomains::MeshPartition::m_dim

protected

Definition at line 126 of file MeshPartition.h.

Referenced by PrintPartInfo(), ReadExpansions(), and WeightElements().

◆ m_edgeWeights

std::map<int, MultiWeight> Nektar::SpatialDomains::MeshPartition::m_edgeWeights

protected

Definition at line 143 of file MeshPartition.h.

Referenced by CreateGraph(), and WeightElements().

◆ m_elements

std::map<int, MeshEntity> Nektar::SpatialDomains::MeshPartition::m_elements

protected

Definition at line 129 of file MeshPartition.h.

Referenced by CreateGraph(), MeshPartition(), PartitionMesh(), and WeightElements().

◆ m_expansions

std::map<int, NummodesPerField> Nektar::SpatialDomains::MeshPartition::m_expansions

protected

Definition at line 135 of file MeshPartition.h.

Referenced by PrintPartInfo(), ReadExpansions(), and WeightElements().

◆ m_fieldNameToId

std::map<std::string, int> Nektar::SpatialDomains::MeshPartition::m_fieldNameToId

protected

Definition at line 140 of file MeshPartition.h.

Referenced by ReadExpansions(), and WeightElements().

◆ m_ghostElmts

std::map<int, MeshEntity> Nektar::SpatialDomains::MeshPartition::m_ghostElmts

protected

Definition at line 130 of file MeshPartition.h.

Referenced by CreateGraph(), MeshPartition(), and PartitionGraph().

◆ m_graph

BoostGraph Nektar::SpatialDomains::MeshPartition::m_graph

protected

Definition at line 145 of file MeshPartition.h.

Referenced by CreateGraph(), PartitionGraph(), and PrintPartInfo().

◆ m_localPartition

std::map<int, std::vector<unsigned int> > Nektar::SpatialDomains::MeshPartition::m_localPartition

protected

Definition at line 146 of file MeshPartition.h.

Referenced by GetElementIDs(), PartitionGraph(), and PrintPartInfo().

◆ m_numFields

int Nektar::SpatialDomains::MeshPartition::m_numFields

protected

Definition at line 127 of file MeshPartition.h.

Referenced by ReadExpansions(), and WeightElements().

◆ m_parallel

bool Nektar::SpatialDomains::MeshPartition::m_parallel

protected

Definition at line 152 of file MeshPartition.h.

Referenced by Nektar::SpatialDomains::MeshPartitionPtScotch::MeshPartitionPtScotch(), PartitionGraph(), and PartitionMesh().

◆ m_session

LibUtilities::SessionReaderSharedPtr Nektar::SpatialDomains::MeshPartition::m_session

protected

Definition at line 123 of file MeshPartition.h.

Referenced by ReadConditions(), and ReadExpansions().

◆ m_shape

std::map<int, LibUtilities::ShapeType> Nektar::SpatialDomains::MeshPartition::m_shape

protected

Definition at line 138 of file MeshPartition.h.

Referenced by PrintPartInfo(), ReadExpansions(), and WeightElements().

◆ m_shared

bool Nektar::SpatialDomains::MeshPartition::m_shared

protected

Definition at line 151 of file MeshPartition.h.

Referenced by PartitionGraph(), and PartitionMesh().

◆ m_vertBndWeights

std::map<int, MultiWeight> Nektar::SpatialDomains::MeshPartition::m_vertBndWeights

protected

Definition at line 142 of file MeshPartition.h.

Referenced by CreateGraph(), and WeightElements().

◆ m_vertWeights

std::map<int, MultiWeight> Nektar::SpatialDomains::MeshPartition::m_vertWeights

protected

Definition at line 141 of file MeshPartition.h.

Referenced by CreateGraph(), and WeightElements().

◆ m_weightBnd

bool Nektar::SpatialDomains::MeshPartition::m_weightBnd

protected

Definition at line 149 of file MeshPartition.h.

Referenced by PartitionGraph(), and ReadConditions().

◆ m_weightDofs

bool Nektar::SpatialDomains::MeshPartition::m_weightDofs

protected

Definition at line 150 of file MeshPartition.h.

Referenced by PartitionGraph(), and ReadConditions().

◆ m_weightingRequired

bool Nektar::SpatialDomains::MeshPartition::m_weightingRequired

protected

Definition at line 148 of file MeshPartition.h.

Referenced by CreateGraph(), PartitionGraph(), PartitionMesh(), and ReadConditions().

Classes

Public Member Functions

Protected Types

Protected Member Functions

Protected Attributes

Detailed Description

Member Typedef Documentation

◆ BoostAdjacencyIterator

◆ BoostEdge

◆ BoostEdgeIterator

◆ BoostGraph

◆ BoostVertex

◆ BoostVertexIterator

◆ MultiWeight

◆ NumModes

◆ NummodesPerField

Constructor & Destructor Documentation

◆ MeshPartition()

◆ ~MeshPartition()

Member Function Documentation

◆ CalculateEdgeWeight()

◆ CalculateElementWeight()

◆ CheckPartitions()

◆ CreateGraph()

◆ GetElementIDs()

◆ PartitionGraph()

◆ PartitionMesh()

◆ PrintPartInfo()

◆ ReadConditions()

◆ ReadExpansions()

◆ v_PartitionGraphImpl()

◆ WeightElements()

Member Data Documentation

◆ m_comm

◆ m_compMap

◆ m_dim

◆ m_edgeWeights

◆ m_elements

◆ m_expansions

◆ m_fieldNameToId

◆ m_ghostElmts

◆ m_graph

◆ m_localPartition

◆ m_numFields

◆ m_parallel

◆ m_session

◆ m_shape

◆ m_shared

◆ m_vertBndWeights

◆ m_vertWeights

◆ m_weightBnd

◆ m_weightDofs

◆ m_weightingRequired