BoxDistribution.hpp

/*
 * MetisDistribution.hpp
 *
 *  Created on: Nov 19, 2015
 *      Author: Antonio Leo
 */
 
#ifndef SRC_DECOMPOSITION_BOXDISTRIBUTION_HPP_
#define SRC_DECOMPOSITION_BOXDISTRIBUTION_HPP_
 
#include "SubdomainGraphNodes.hpp"
#include "Vector/map_vector.hpp"
#include "VCluster/VCluster.hpp"
#include "Graph/map_graph.hpp"
#include "Graph/CartesianGraphFactory.hpp"
#include "VTKWriter/VTKWriter.hpp"
 
#define BOX_DISTRIBUTION_ERROR_OBJECT std::runtime_error("Box distribution runtime error");
 
 
void getPrimeFactors(int n, openfpm::vector<int> & fact )
{
   while (n%2 == 0)
   {
      fact.add(2);
      n = n/2;
   }
   for (int i = 3; i <= sqrt(n); i = i+2)
   {
      while (n%i == 0)
      {
         fact.add(i);
         n = n/i;
      }
   }
   if (n > 2)
   {fact.add(n);}
}
 
 
template<unsigned int dim, typename T>
class BoxDistribution
{
    Vcluster<> & v_cl;
 
    grid_sm<dim, void> gr;
 
    Box<dim, T> domain;
 
    Graph_CSR<nm_v<dim>, nm_e> gp;
 
    bool testing = false;
 
        openfpm::vector<int> subsub_own;
 
    inline void check_overflow(size_t id)
    {
#ifdef SE_CLASS1
        if (id >= gp.getNVertex())
        {
            std::cerr << "Error " << __FILE__ ":" << __LINE__ << " such sub-sub-domain doesn't exist (id = " << id << ", " << "total size = " << gp.getNVertex() << ")\n";
                        ACTION_ON_ERROR(BOX_DISTRIBUTION_ERROR_OBJECT)
        }
#endif
    }
 
    inline void check_overflowe(size_t id, size_t e)
    {
#ifdef SE_CLASS1
        if (e >= gp.getNChilds(id))
        {
            std::cerr << "Error " << __FILE__ ":" << __LINE__ << " for the sub-sub-domain " << id << " such neighborhood doesn't exist (e = " << e << ", " << "total size = " << gp.getNChilds(id) << ")\n";
                        ACTION_ON_ERROR(BOX_DISTRIBUTION_ERROR_OBJECT)
        }
#endif
    }
 
public:
 
    static constexpr unsigned int computation = nm_v_computation;
 
        BoxDistribution(Vcluster<> & v_cl)
        :v_cl(v_cl)
    {
#ifdef SE_CLASS2
            check_new(this,8,VECTOR_EVENT,1);
#endif
    }
 
        BoxDistribution(const BoxDistribution & mt)
    :v_cl(mt.v_cl)
    {
#ifdef SE_CLASS2
            check_valid(mt);
            check_new(this,8,VECTOR_EVENT,1);
#endif
        this->operator=(mt);
    }
 
        BoxDistribution(BoxDistribution && mt)
    {
#ifdef SE_CLASS2
            check_valid(mt);
            check_new(this,8,VECTOR_EVENT,1);
#endif
        this->operator=(mt);
    }
 
        ~BoxDistribution()
    {
#ifdef SE_CLASS2
        check_delete(this);
#endif
    }
 
 
    void createCartGraph(grid_sm<dim, void> & grid, Box<dim, T> dom)
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        // NON periodic boundary conditions
        size_t bc[dim];
 
        for (size_t i = 0 ; i < dim ; i++)
            bc[i] = NON_PERIODIC;
 
        // Set grid and domain
        gr = grid;
        domain = dom;
 
        // Create a cartesian grid graph
        CartesianGraphFactory<dim, Graph_CSR<nm_v<dim>, nm_e>> g_factory_part;
        gp = g_factory_part.template construct<NO_EDGE, nm_v_id, T, dim - 1, 0>(gr.getSize(), domain, bc);
 
        // Init to 0.0 axis z (to fix in graphFactory)
        if (dim < 3)
        {
            for (size_t i = 0; i < gp.getNVertex(); i++)
            {
                gp.vertex(i).template get<nm_v_x>()[2] = 0.0;
            }
        }
 
        for (size_t i = 0; i < gp.getNVertex(); i++)
            gp.vertex(i).template get<nm_v_global_id>() = i;
    }
 
    Graph_CSR<nm_v<dim>, nm_e> & getGraph()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        return gp;
    }
 
    void decompose()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
 
                subsub_own.clear();
                grid_key_dx_iterator<dim> it(gr);
 
                openfpm::vector<int> facts;
                getPrimeFactors(v_cl.size(),facts);
 
                size_t div[dim];
                size_t ln[dim];
                double ln_d[dim];
 
                for (int i = 0 ; i < dim ; i++)
                {div[i] = 1;}
 
                for (int i = 0 ; i < facts.size() ; i++)
                {div[i % dim] *= facts.get(i);}
 
                for (int i = 0 ; i < dim ; i++)
                {
                    ln[i] = gr.size(i) / div[i];
                    ln_d[i] = (double)gr.size(i) / div[i];
                }
 
                grid_sm<dim,void> gr_proc(div);
 
                while (it.isNext())
                {
                    auto key = it.get();
 
                    grid_key_dx<dim> key_prc;
 
                    for (int i = 0 ; i < dim ; i++)
                    {
                        key_prc.set_d(i,key.get(i)/ln_d[i]);
                        if (key_prc.get(i) >= div[i])
                        {key_prc.set_d(i,div[i]-1);}
                    }
 
                    size_t i = gr.LinId(key);
 
                    gp.vertex(i).template get<nm_v_proc_id>() = gr_proc.LinId(key_prc);
 
                    if (gp.vertex(i).template get<nm_v_proc_id>() == v_cl.rank())
                    {subsub_own.add(i);}
 
                    ++it;
                }
    }
 
    void refine()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
 
        decompose();
    }
 
    void redecompose()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        decompose();
    }
 
 
    void getSSDomainPos(size_t id, T (&pos)[dim])
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        check_overflow(id);
 
        // Copy the geometrical informations inside the pos vector
        pos[0] = gp.vertex(id).template get<nm_v_x>()[0];
        pos[1] = gp.vertex(id).template get<nm_v_x>()[1];
        if (dim == 3)
        {pos[2] = gp.vertex(id).template get<nm_v_x>()[2];}
    }
 
    size_t getComputationalCost(size_t id)
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        check_overflow(id);
        return gp.vertex(id).template get<nm_v_computation>();
    }
 
 
    void setComputationCost(size_t id, size_t cost)
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
#ifdef SE_CLASS1
        check_overflow(id);
#endif
    }
 
    void setMigrationCost(size_t id, size_t cost)
    {
#ifdef SE_CLASS2
        check_valid(this,8);
#endif
#ifdef SE_CLASS1
        check_overflow(id);
#endif
    }
 
    void setCommunicationCost(size_t id, size_t e, size_t cost)
    {
#ifdef SE_CLASS2
        check_valid(this,8);
#endif
#ifdef SE_CLASS1
        check_overflow(id);
        check_overflowe(id,e);
#endif
    }
 
    size_t getNSubSubDomains()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        return gp.getNVertex();
    }
 
    size_t getNSubSubDomainNeighbors(size_t id)
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
#ifdef SE_CLASS1
        check_overflow(id);
#endif
 
        return gp.getNChilds(id);
    }
 
    float getUnbalance()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
                return 0.0;
    }
 
    size_t getNOwnerSubSubDomains() const
    {
                return subsub_own.size();
    }
 
    size_t getOwnerSubSubDomain(size_t id) const
    {
        return subsub_own.get(id);
    }
 
    void onTest()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        testing = true;
    }
 
    void write(std::string out)
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
 
        VTKWriter<Graph_CSR<nm_v<dim>, nm_e>, VTK_GRAPH> gv2(gp);
        gv2.write(std::to_string(v_cl.getProcessUnitID()) + "_" + out + ".vtk");
 
    }
 
    size_t getProcessorLoad()
    {
#ifdef SE_CLASS2
            check_valid(this,8);
#endif
        openfpm::vector<size_t> loads(v_cl.getProcessingUnits());
 
        size_t load = 0;
 
        if (v_cl.getProcessUnitID() == 0)
        {
            for (size_t i = 0; i < gp.getNVertex(); i++)
            {loads.get(gp.template vertex_p<nm_v_proc_id>(i)) += gp.template vertex_p<nm_v_computation>(i);}
 
            for (size_t i = 0 ; i < v_cl.getProcessingUnits() ; i++)
            {
                v_cl.send(i,1234,&loads.get(i),sizeof(size_t));
            }
        }
        v_cl.recv(0,1234,&load,sizeof(size_t));
        v_cl.execute();
 
        return load;
    }
 
    BoxDistribution & operator=(const BoxDistribution & mt)
    {
#ifdef SE_CLASS2
            check_valid(&mt,8);
            check_valid(this,8);
#endif
 
        this->gr = mt.gr;
        this->domain = mt.domain;
        this->gp = mt.gp;
        this->subsub_own = mt.subsub_own;
        return *this;
    }
 
    BoxDistribution & operator=(BoxDistribution && mt)
    {
#ifdef SE_CLASS2
            check_valid(mt);
            check_valid(this,8);
#endif
        this->gr = mt.gr;
        this->domain = mt.domain;
        this->gp.swap(mt.gp);
        this->subsub_own.swap(mt.subsub_own);
        return *this;
    }
 
    inline bool operator==(const BoxDistribution & mt)
    {
#ifdef SE_CLASS2
            check_valid(&mt,8);
            check_valid(this,8);
#endif
        bool ret = true;
 
        ret &= (this->gr == mt.gr);
        ret &= (this->domain == mt.domain);
        ret &= (this->gp == mt.gp);
 
        ret &= this->subsub_own == mt.subsub_own;
 
        return ret;
    }
 
    void setDistTol(double tol)
    {
    }
 
 
 
    size_t getSubSubDomainComputationCost(size_t id)
    {
#ifdef SE_CLASS1
        if (id >= gp.getNVertex())
            std::cerr << __FILE__ << ":" << __LINE__ << "Such vertex doesn't exist (id = " << id << ", " << "total size = " << gp.getNVertex() << ")\n";
#endif
        return 1;
    }
 
    size_t get_ndec()
    {
        return 0;
    }
};
 
#endif /* SRC_DECOMPOSITION_METISDISTRIBUTION_HPP_ */