You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
105 lines
4.7 KiB
105 lines
4.7 KiB
<!-------- @HEADER
|
|
!
|
|
! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
|
|
!
|
|
! Zoltan Toolkit for Load-balancing, Partitioning, Ordering and Coloring
|
|
! Copyright 2012 Sandia Corporation
|
|
!
|
|
! Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
|
|
! the U.S. Government retains certain rights in this software.
|
|
!
|
|
! Redistribution and use in source and binary forms, with or without
|
|
! modification, are permitted provided that the following conditions are
|
|
! met:
|
|
!
|
|
! 1. Redistributions of source code must retain the above copyright
|
|
! notice, this list of conditions and the following disclaimer.
|
|
!
|
|
! 2. Redistributions in binary form must reproduce the above copyright
|
|
! notice, this list of conditions and the following disclaimer in the
|
|
! documentation and/or other materials provided with the distribution.
|
|
!
|
|
! 3. Neither the name of the Corporation nor the names of the
|
|
! contributors may be used to endorse or promote products derived from
|
|
! this software without specific prior written permission.
|
|
!
|
|
! THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
|
|
! EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
! IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
! PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
|
|
! CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
! EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
! PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
! PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
! LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
! NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
! SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
!
|
|
! Questions? Contact Karen Devine kddevin@sandia.gov
|
|
! Erik Boman egboman@sandia.gov
|
|
!
|
|
! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
|
|
!
|
|
! @HEADER
|
|
------->
|
|
<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
|
|
<html>
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
|
|
<meta name="GENERATOR" content="Mozilla/4.76 [en] (X11; U; Linux 2.4.2-2smp i686) [Netscape]">
|
|
<meta name="sandia.approval_type" content="formal">
|
|
<meta name="sandia.approved" content="SAND2007-4748W">
|
|
<meta name="author" content="Zoltan PI">
|
|
|
|
<title>Zoltan User's Guide: Geometric (Coordinate-Based) Partitioners</title>
|
|
</head>
|
|
<body bgcolor="#FFFFFF">
|
|
|
|
<div align=right><b><i><a href="ug.html">Zoltan User's Guide</a>
|
|
| <a href="ug_alg_rcb.html">Next</a> | <a href="ug_alg_random.html">Previous</a></i></b></div>
|
|
|
|
<h2>
|
|
<a name="GEOM"></a>Geometric (Coordinate-based) Partitioners</h2>
|
|
|
|
Geometric partitioners divide data into parts based on the physical
|
|
coordinates of the data. Objects assigned to a single part tend to be
|
|
physically close to each other in space. Such partitioners are very useful for
|
|
applications that don't have explicit
|
|
connectivity information (such as particle methods) or for which geometric
|
|
locality is important (such as contact detection).
|
|
They are also widely used in adaptive finite
|
|
element methods because, in general, they execute very quickly and yield
|
|
moderately good partition quality.
|
|
|
|
<p>
|
|
The geometric methods are the easiest non-trivial partitioners to incorporate
|
|
into applications, as they require only four callbacks: two returning
|
|
<a href="ug_query_lb.html#General Functions">object information</a> and
|
|
two returning <a href="ug_query_lb.html#Geometry-based Functions">coordinate
|
|
information</a>.
|
|
|
|
<p>
|
|
We group <a href="ug_alg_reftree.html">refinement-tree partitioning</a>
|
|
for adaptive mesh refinement applications
|
|
into the geometric partitioners because
|
|
it uses geometric information to determine an initial ordering for coarse
|
|
elements of adaptively refined meshes. The refinement-tree partitioner
|
|
also requires <a href="ug_query_lb.html#Tree-based Functions">tree-based
|
|
callbacks</a> with connectivity information between
|
|
coarse and fine elements in refined meshes.
|
|
|
|
<blockquote>
|
|
<a href="ug_alg_rcb.html">Recursive Coordinate Bisection</a> (RCB)
|
|
<br><a href="ug_alg_rib.html">Recursive Inertial Bisection</a> (RIB)
|
|
<br><a href="ug_alg_hsfc.html">Hilbert Space-Filling Curve Partitioning</a> (HSFC)
|
|
<br><a href="ug_alg_reftree.html">Refinement Tree Based Partitioning</a> (Reftree)
|
|
</blockquote>
|
|
|
|
|
|
|
|
<p>
|
|
<hr WIDTH="100%">[<a href="ug.html">Table of Contents</a> | <a href="ug_alg_rcb.html">Next:
|
|
Recursive Coordinate Bisection</a> | <a href="ug_alg_random.html">Previous:
|
|
Random Partitioning</a> | <a href="https://www.sandia.gov/general/privacy-security/index.html">Privacy and Security</a>]
|
|
</body>
|
|
</html>
|
|
|