linear_partitioner.C

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2018 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner

// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.

// This library 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.

// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA



// Local Includes
#include "libmesh/linear_partitioner.h"
#include "libmesh/libmesh_logging.h"
#include "libmesh/elem.h"

namespace libMesh
{

void LinearPartitioner::partition_range(MeshBase & mesh,
                                        MeshBase::element_iterator it,
                                        MeshBase::element_iterator end,
                                        const unsigned int n)
{
  const bool mesh_is_serial = mesh.is_serial();

  // Check for easy returns
  if (it == end && mesh_is_serial)
    return;

  if (n == 1)
    {
      this->single_partition_range (it, end);
      return;
    }

  libmesh_assert_greater (n, 0);

  // Create a simple linear partitioning
  LOG_SCOPE ("partition_range()", "LinearPartitioner");

  // This has to be an ordered set
  std::set<dof_id_type> element_ids;

  // If we're on a serialized mesh, we know our range is the same on
  // every processor.
  if (mesh_is_serial)
    {
      const dof_id_type blksize = cast_int<dof_id_type>
        (std::distance(it, end) / n);

      dof_id_type e = 0;
      for (auto & elem : as_range(it, end))
        {
          if ((e/blksize) < n)
            elem->processor_id() = cast_int<processor_id_type>(e/blksize);
          else
            elem->processor_id() = 0;

          e++;
        }
    }
  // If we're on a replicated mesh, we might have different ranges on
  // different processors, and we'll need to gather the full range.
  //
  // This is not an efficient way to do this, but if you want to be
  // efficient then you want to be using a different partitioner to
  // begin with; LinearPartitioner is more for debugging than
  // performance.
  else
    {
      for (const auto & elem : as_range(it, end))
        element_ids.insert(elem->id());

      mesh.comm().set_union(element_ids);

      const dof_id_type blksize = cast_int<dof_id_type>
        (element_ids.size());

      dof_id_type e = 0;
      for (auto eid : element_ids)
        {
          Elem * elem = mesh.query_elem_ptr(eid);
          if (elem)
            {
              if ((e/blksize) < n)
                elem->processor_id() = cast_int<processor_id_type>(e/blksize);
              else
                elem->processor_id() = 0;
            }

          e++;
        }
    }
}



void LinearPartitioner::_do_partition (MeshBase & mesh,
                                       const unsigned int n)
{
  this->partition_range(mesh,
                        mesh.active_elements_begin(),
                        mesh.active_elements_end(),
                        n);
}

} // namespace libMesh