morton_partitioning_process.h

Go to the documentation of this file.

/*
==============================================================================
KratosPFEMApplication
A library based on:
Kratos
A General Purpose Software for Multi-Physics Finite Element Analysis
Version 1.0 (Released on march 05, 2007).
 
Copyright 2007
Pooyan Dadvand, Riccardo Rossi
pooyan@cimne.upc.edu
rrossi@cimne.upc.edu
- CIMNE (International Center for Numerical Methods in Engineering),
Gran Capita' s/n, 08034 Barcelona, Spain
 
 
Permission is hereby granted, free  of charge, to any person obtaining
a  copy  of this  software  and  associated  documentation files  (the
"Software"), to  deal in  the Software without  restriction, including
without limitation  the rights to  use, copy, modify,  merge, publish,
distribute,  sublicense and/or  sell copies  of the  Software,  and to
permit persons to whom the Software  is furnished to do so, subject to
the following condition:
 
Distribution of this code for  any  commercial purpose  is permissible
ONLY BY DIRECT ARRANGEMENT WITH THE COPYRIGHT OWNERS.
 
The  above  copyright  notice  and  this permission  notice  shall  be
included in all copies or substantial portions of the Software.
 
THE  SOFTWARE IS  PROVIDED  "AS  IS", WITHOUT  WARRANTY  OF ANY  KIND,
EXPRESS OR  IMPLIED, INCLUDING  BUT NOT LIMITED  TO THE  WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT  SHALL THE AUTHORS OR COPYRIGHT HOLDERS  BE LIABLE FOR ANY
CLAIM, DAMAGES OR  OTHER LIABILITY, WHETHER IN AN  ACTION OF CONTRACT,
TORT  OR OTHERWISE, ARISING  FROM, OUT  OF OR  IN CONNECTION  WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
==============================================================================
*/
 
//
//   Project Name:        Kratos
//   Last Modified by:    $Author: rrossi $
//   Date:                $Date: 2009-01-15 11:11:35 $
//   Revision:            $Revision: 1.6 $
//
//
 
 
#pragma once
 
// System includes
 
// Project includes
#include "includes/io.h"
#include "processes/process.h"
 
namespace Kratos
{
 
 
 
 
 
 
 
 
class MortonPartitioningProcess
    : public Process
{
public:
 
    typedef idx_t idxtype;
 
    KRATOS_CLASS_POINTER_DEFINITION(MortonPartitioningProcess);
 
    typedef std::size_t SizeType;
    typedef std::size_t IndexType;
    typedef std::vector<idxtype> PartitionIndicesType;
 
 
    MortonPartitioningProcess(IO::ConnectivitiesContainerType& rElementsConnectivities,
                              IO::NodesContainerType& rNodesContainer,
                                  PartitionIndicesType& rNodesPartitions,
                                  PartitionIndicesType& rElementsPartitions,
                                  SizeType NumberOfPartitions, int Dimension = 3)
        : mrElementsConnectivities(rElementsConnectivities),
          mrNodesContainer(rNodesContainer),
          mrNodesPartitions(rNodesPartitions),
          mrElementsPartitions(rElementsPartitions),
          mNumberOfPartitions(NumberOfPartitions),
          mDimension(Dimension)
    {
    }
 
    MortonPartitioningProcess(MortonPartitioningProcess const& rOther)
        : mrElementsConnectivities(rOther.mrElementsConnectivities),
          mrNodesContainer(rOther.mrNodesContainer),
          mrNodesPartitions(rOther.mrNodesPartitions),
          mrElementsPartitions(rOther.mrElementsPartitions),
          mNumberOfPartitions(rOther.mNumberOfPartitions),
          mDimension(rOther.mDimension)
    {
    }
 
    virtual ~MortonPartitioningProcess()
    {
    }
 
 
 
    void operator()()
    {
        Execute();
    }
 
 
 
    void Execute() override
    {
        KRATOS_TRY;
 
        if(mNumberOfPartitions < 2) // There is no need to partition it and just reading the input
        {
            return;
        }
 
        int number_of_elements = mrElementsConnectivities.size();
 
        int number_of_nodes = 0;
        int real_r_of_nodes = 0;
        // calculating number of nodes considering sequencial numbering!! We can get it from input for no sequencial one. Pooyan.
        for(IO::ConnectivitiesContainerType::iterator i_element = mrElementsConnectivities.begin() ; i_element != mrElementsConnectivities.end() ; i_element++)
            for(IO::ConnectivitiesContainerType::value_type::iterator i_node_id = i_element->begin() ; i_node_id != i_element->end() ; i_node_id++)
            {
                if(static_cast<int>(*i_node_id) > number_of_nodes)
                    number_of_nodes = *i_node_id;
 
                real_r_of_nodes++;
            }
 
        //verify that all of the nodes exist
        std::vector< bool > aux(number_of_nodes,false);
        // calculating number of nodes considering sequencial numbering!! We can get it from input for no sequencial one. Pooyan.
        for(IO::ConnectivitiesContainerType::iterator i_element = mrElementsConnectivities.begin() ; i_element != mrElementsConnectivities.end() ; i_element++)
            for(IO::ConnectivitiesContainerType::value_type::iterator i_node_id = i_element->begin() ; i_node_id != i_element->end() ; i_node_id++)
            {
                aux[static_cast<int>(*i_node_id)-1] = true;
            }
 
        mrElementsPartitions.resize(number_of_elements);
        mrNodesPartitions.resize(number_of_nodes);
 
        idxtype* epart = &(*(mrElementsPartitions.begin()));
        idxtype* npart = &(*(mrNodesPartitions.begin()));
 
        AssignPartition(number_of_nodes, real_r_of_nodes, npart, epart);
 
        KRATOS_CATCH("")
    }
 
 
 
 
 
 
 
    std::string Info() const override
    {
        return "MortonPartitioningProcess";
    }
 
    void PrintInfo(std::ostream& rOStream) const override
    {
        rOStream << "MortonPartitioningProcess";
    }
 
    void PrintData(std::ostream& rOStream) const override
    {
    }
 
 
 
 
 
protected:
 
 
 
    IO::ConnectivitiesContainerType& mrElementsConnectivities;
    IO::NodesContainerType& mrNodesContainer;
    PartitionIndicesType& mrNodesPartitions;
    PartitionIndicesType& mrElementsPartitions;
    SizeType mNumberOfPartitions;
    SizeType mDimension;
 
 
 
 
 
    void AssignPartition(SizeType NumberOfNodes, SizeType NumberOfElements, idxtype* NPart, idxtype* EPart)
    {
        for(SizeType i_element = 0 ; i_element < NumberOfElements ; i_element++)
        {
            for(IO::ConnectivitiesContainerType::value_type::iterator i_node = mrElementsConnectivities[i_element].begin() ;
                    i_node != mrElementsConnectivities[i_element].end() ; i_node++)
            {
                //IO::NodesContainerType::iterator i_nod = mrNodesContainer.begin() + (*i_node-1);
 
                NPart[(*i_node-1)] = i_element%mNumberOfPartitions;
                EPart[i_element] = i_element%mNumberOfPartitions;
            }
        }
    }
 
 
 
 
 
 
 
 
private:
 
 
 
 
 
 
 
 
 
 
 
    MortonPartitioningProcess& operator=(MortonPartitioningProcess const& rOther);
 
    //MortonGraphPartitioningProcess(MortonPartitioningProcess const& rOther);
 
 
 
}; // Class MortonGraphPartitioningProcess
 
 
 
 
 
 
inline std::istream& operator >> (std::istream& rIStream,
                                  MortonPartitioningProcess& rThis);
 
inline std::ostream& operator << (std::ostream& rOStream,
                                  const MortonPartitioningProcess& rThis)
{
    rThis.PrintInfo(rOStream);
    rOStream << std::endl;
    rThis.PrintData(rOStream);
 
    return rOStream;
}
 
}  // namespace Kratos.