partitioner_dynamic_bisection.h

Go to the documentation of this file.

/*
 * Copyright (c) 2013-2015:  G-CSC, Goethe University Frankfurt
 * Author: Sebastian Reiter
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
 */
 
#ifndef __H__UG__partitioner_dynamic_biscection__
#define __H__UG__partitioner_dynamic_biscection__
 
#include <utility>
#include <vector>
#include "parallel_grid_layout.h"
#include "partitioner.h"
#include "pcl/pcl_interface_communicator.h"
 
namespace ug{
 
 
 
template <class TElem, int dim>
class Partitioner_DynamicBisection : public IPartitioner{
  public:
    typedef IPartitioner              base_class;
    typedef TElem                 elem_t;
    typedef typename TElem::side          side_t;
    typedef MathVector<dim>             vector_t;
    typedef Attachment<vector_t>          apos_t;
    typedef Grid::VertexAttachmentAccessor<apos_t>  aapos_t;
    typedef typename GridLayoutMap::Types<elem_t>::Layout::LevelLayout  layout_t;
 
    Partitioner_DynamicBisection();
    virtual ~Partitioner_DynamicBisection();
 
    void set_grid(MultiGrid* mg, Attachment<MathVector<dim> > aPos);
 
    void set_subset_handler(SmartPtr<SubsetHandler> sh);
 
 
    void set_tolerance(number tol)  {m_tolerance = tol;}
 
 
    void enable_longest_split_axis(bool enable) {m_longestSplitAxisEnabled = enable;}
 
 
    void enable_split_axis(int axis, bool enable);
 
 
    void set_start_split_axis(int axis)     {m_startSplitAxis = axis;}
 
    int num_split_improvement_iterations() const  {return m_splitImproveIterations;}
    void set_num_split_improvement_iterations(int num)  {m_splitImproveIterations = num;}
    
    virtual void set_next_process_hierarchy(SPProcessHierarchy procHierarchy);
    virtual void set_balance_weights(SPBalanceWeights balanceWeights);
//    virtual void set_connection_weights(SmartPtr<ConnectionWeights<dim> >);
 
    virtual void set_partition_pre_processor(SPPartitionPreProcessor ppp);
    virtual void set_partition_post_processor(SPPartitionPostProcessor ppp);
 
    virtual ConstSPProcessHierarchy current_process_hierarchy() const;
    virtual ConstSPProcessHierarchy next_process_hierarchy() const;
 
    virtual bool supports_balance_weights() const;
    virtual bool supports_connection_weights() const;
    virtual bool supports_repartitioning() const      {return false;}
 
    virtual bool partition(size_t baseLvl, size_t elementThreshold);
 
    virtual SubsetHandler& get_partitions();
    virtual const std::vector<int>* get_process_map() const;
 
    void enable_static_partitioning(bool enable);
    bool static_partitioning_enabled() const;
 
  private:
    enum constants{
      UNCLASSIFIED = 0,
      LEFT = 1,
      RIGHT = 1 << 1,
      CUTTING = LEFT | RIGHT,
      CUTTING_CENTER_LEFT,
      CUTTING_CENTER_RIGHT,
      TOTAL,
      NUM_CONSTANTS
    };
    enum constants {…};
 
    static const size_t s_invalidIndex = -1;
 
    struct Entry{
      elem_t* elem;
      size_t  next;
      Entry(elem_t* e) : elem(e), next(s_invalidIndex)  {}
    };
    struct Entry {…};
 
    struct ElemList{
      ElemList() :
        m_entries(NULL), m_first(s_invalidIndex), m_last(s_invalidIndex), m_num(0)    {}
      ElemList() : {…}
      ElemList(std::vector<Entry>* entries) :
        m_entries(entries), m_first(s_invalidIndex), m_last(s_invalidIndex), m_num(0) {}
      ElemList(std::vector<Entry>* entries) : {…}
 
      void set_entry_list(std::vector<Entry>* entries)  {m_entries = entries;}
 
      void add(size_t entryInd)
      {
        if(m_first == s_invalidIndex){
          m_first = m_last = entryInd;
          m_num = 1;
        }
        else{
          (*m_entries)[m_last].next = entryInd;
          m_last = entryInd;
          ++m_num;
        }
        (*m_entries)[entryInd].next = s_invalidIndex;
      }
      void add(size_t entryInd) {…}
 
      void clear()
      {
        m_first = m_last = s_invalidIndex;
        m_num = 0;
      }
      void clear() {…}
 
      size_t size() const {return m_num;}
      bool empty() const {return m_num == 0;}
 
      size_t first() const        {return m_first;}
      size_t last() const         {return m_last;}
      size_t next(size_t entryInd) const  {return (*m_entries)[entryInd].next;}
      elem_t* elem(size_t entryInd) const {return (*m_entries)[entryInd].elem;}
 
      std::vector<Entry>* entries()   {return m_entries;}
 
      private:
        std::vector<Entry>* m_entries;
        size_t m_first;
        size_t m_last;
        size_t m_num;
    };
    struct ElemList {…};
 
 
    struct TreeNode{
      ElemList  elems;
      int     firstProc;
      int     numTargetProcs;
 
      number    ratioLeft;
      size_t    firstChildNode;
 
      vector_t  center;
      vector_t  boxMin;
      vector_t  boxMax;
      number    totalWeight;
 
      number    splitValue;
      int     splitAxis;
      number    minSplitValue;
      number    maxSplitValue;
 
      bool    bisectionComplete;
    };
    struct TreeNode {…};
 
 
    void perform_bisection(int numTargetProcs, int minLvl, int maxLvl,
                 int partitionLvl, ANumber aWeight,
                 pcl::ProcessCommunicator com);
 
    void control_bisection(ISubsetHandler& partitionSH,
                 std::vector<TreeNode>& treeNodes, ANumber aWeight,
                 number maxChildWeight, pcl::ProcessCommunicator& com);
 
    void bisect_elements(std::vector<TreeNode>& childNodesOut,
               std::vector<TreeNode>& parentNodes,
               ANumber aWeight, number maxChildWeight,
               pcl::ProcessCommunicator& com,
               int cutRecursion, int splitAxis);
 
 
    int get_next_split_axis();
 
    int get_next_split_axis(int lastAxis) const;
 
 
    void copy_partitions_to_children(ISubsetHandler& partitionSH, int lvl);
 
    void calculate_global_dimensions(std::vector<TreeNode>& treeNodes,
                     number maxChildWeight, ANumber aWeight,
                     pcl::ProcessCommunicator& com);
 
    void gather_weights_from_level(int baseLvl, int childLvl, ANumber aWeight,
                     bool copyToVMastersOnBaseLvl, bool markedElemsOnly);
 
    int classify_elem(elem_t* e, int splitAxis, number splitValue);
 
    void improve_split_values(std::vector<TreeNode>& treeNodes,
                  size_t maxIterations, ANumber aWeight,
                  pcl::ProcessCommunicator& com);
  
 
    MultiGrid*                m_mg;
    apos_t                  m_aPos;
    aapos_t                 m_aaPos;
    SmartPtr<SubsetHandler>         m_sh;
    SPProcessHierarchy            m_processHierarchy;
    SPProcessHierarchy            m_nextProcessHierarchy;
    pcl::InterfaceCommunicator<layout_t>  m_intfcCom;
    std::vector<Entry>            m_entries;
 
    SPBalanceWeights            m_balanceWeights;
    SPPartitionPreProcessor         m_partitionPreProcessor;
    SPPartitionPostProcessor        m_partitionPostProcessor;
 
    bool  m_staticPartitioning;
 
    number  m_tolerance;
    size_t  m_splitImproveIterations;
 
    int   m_longestSplitAxisEnabled;
    int   m_startSplitAxis;
    int   m_lastSplitAxis;
    bool  m_splitAxisEnabled[dim];
    int   m_numSplitAxisEnabled;
    int   m_firstSplitAxisEnabled;
 
  //  the following parameters are only used if the partitioner operates in
  //  static mode
    std::vector<int>  m_procMap;
    int         m_highestRedistLevel;
};
class Partitioner_DynamicBisection : public IPartitioner {…};
 
 
}// end of namespace
 
#endif