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.
259 lines
8.2 KiB
259 lines
8.2 KiB
2 years ago
|
<!-------- @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.7 [en] (X11; U; SunOS 5.7 sun4u) [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: RIB</title>
|
||
|
|
</head>
|
||
|
|
<body bgcolor="#FFFFFF">
|
||
|
|
|
||
|
|
<div ALIGN=right><b><i><a href="ug.html">Zoltan User's Guide</a> | <a href="ug_alg_hsfc.html">Next</a> | <a href="ug_alg_rcb.html">Previous</a></i></b></div>
|
||
|
|
|
||
|
|
|
||
|
|
<h2>
|
||
|
|
<a NAME="RIB"></a>Recursive Inertial Bisection (RIB)</h2>
|
||
|
|
An implementation of Recursive Inertial Bisection (RIB) is included in
|
||
|
|
Zoltan. RIB was proposed as a load-balancing algorithm by
|
||
|
|
<a href="ug_refs.html#williams">Williams</a> and later studied
|
||
|
|
by <a href="ug_refs.html#taylor">Taylor and Nour-Omid</a>, but its
|
||
|
|
origin is unclear. RIB is similar to RCB in that it divides the domain based on
|
||
|
|
the location of the objects being partitioned by use of cutting planes.
|
||
|
|
In RIB, the computational domain is first divided into two regions by a
|
||
|
|
cutting plane orthogonal to the longest direction of the domain so that half
|
||
|
|
the work load is in each of the sub-regions. The sub-regions are then further
|
||
|
|
divided by recursive application of the same splitting algorithm until
|
||
|
|
the number of sub-regions equals the number of processors. Although this
|
||
|
|
algorithm was first devised to cut into a number of sets which is a power
|
||
|
|
of two, the set sizes in a particular cut needn't be equal. By adjusting
|
||
|
|
the part sizes appropriately, any number of equally-sized sets can
|
||
|
|
be created. If the parallel machine has processors with different speeds,
|
||
|
|
sets with nonuniform sizes can also be easily generated. The Zoltan implementation
|
||
|
|
of RIB has several parameters which can be modified by the <b><a href="ug_interface_init.html#Zoltan_Set_Param">Zoltan_Set_Param</a></b>
|
||
|
|
function.
|
||
|
|
<p>
|
||
|
|
RIB currently does not support multiple vertex weights. For such cases, use RCB instead.
|
||
|
|
</p>
|
||
|
|
<br>
|
||
|
|
<table WIDTH="100%" NOSAVE >
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP WIDTH="20%"><b>Method String:</b></td>
|
||
|
|
|
||
|
|
<td><b>RIB</b></td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td><b>Parameters:</b></td>
|
||
|
|
|
||
|
|
<td></td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP> <i>RIB_OVERALLOC</i></td>
|
||
|
|
|
||
|
|
<td>The amount by which to over-allocate temporary storage arrays for objects
|
||
|
|
within the RIB algorithm when additional storage is due to changes in processor
|
||
|
|
assignments.
|
||
|
|
<br>1.0 = no extra storage allocated; 1.5 = 50% extra storage; etc.</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP NOSAVE> <i> RIB_OUTPUT_LEVEL</i></td>
|
||
|
|
|
||
|
|
<td>Flag controlling the amount of timing and diagnostic output the routine
|
||
|
|
produces.
|
||
|
|
<br>0 = no output; 1 = print summary; 2 = print data for each processor.</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP NOSAVE> <i> CHECK_GEOM</i></td>
|
||
|
|
|
||
|
|
<td>Flag controlling the invocation of input and output error checking.
|
||
|
|
<br>0 = don't do checking; 1 = do checking.</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP NOSAVE> <i> KEEP_CUTS</i></td>
|
||
|
|
|
||
|
|
<td>Should information about the cuts determining the RIB decomposition
|
||
|
|
be retained? It costs a bit of time to do so, but this information is necessary
|
||
|
|
if application wants to add more objects to the decomposition via calls
|
||
|
|
to <b><a href="ug_interface_augment.html#Zoltan_LB_Point_PP_Assign">Zoltan_LB_Point_PP_Assign</a></b>
|
||
|
|
or to <b><a href="ug_interface_augment.html#Zoltan_LB_Box_PP_Assign">Zoltan_LB_Box_PP_Assign</a></b>.
|
||
|
|
<br>0 = don't keep cuts; 1 = keep cuts.</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP NOSAVE> <i> AVERAGE_CUTS</i></td>
|
||
|
|
|
||
|
|
<td>When set to one, coordinates of RIB cutting planes are computed to be the
|
||
|
|
average of the coordinates of the closest object on each side of the cut.
|
||
|
|
Otherwise, coordinates of cutting planes may equal those of one of the
|
||
|
|
closest objects.
|
||
|
|
<br>0 = don't average cuts; 1 = average cuts.</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP NOSAVE> <i> REDUCE_DIMENSIONS</i></td>
|
||
|
|
<td>
|
||
|
|
When a 3 dimensional geometry is almost flat, it may make more
|
||
|
|
sense to treat it as a 2 dimensional geometry when applying the RIB
|
||
|
|
algorithm. (Coordinate values in the omitted direction are ignored
|
||
|
|
for the purposes of partitioning.)
|
||
|
|
If this parameter is set to <B>1</B>, a 3 dimensional
|
||
|
|
geometry will be treated as 2 dimensional if it is very flat,
|
||
|
|
or 1 dimensional if it is very thin. A 2 dimensional geometry will
|
||
|
|
be treated as 1 dimensional if it is very thin.
|
||
|
|
</td>
|
||
|
|
</tr>
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP NOSAVE> <i> DEGENERATE_RATIO</i></td>
|
||
|
|
<td>
|
||
|
|
If the <B>REDUCE_DIMENSIONS</B> parameter is set, then this parameter
|
||
|
|
determines when a geometry is considered to be degenerate.
|
||
|
|
A bounding box which is oriented to the geometry is constructed, and
|
||
|
|
the lengths of its sides are tested against a ratio of 1 : <B>DEGENERATE_RATIO</B>.
|
||
|
|
</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP><b>Default:</b></td>
|
||
|
|
|
||
|
|
<td></td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>RIB_OVERALLOC</i> = 1.2</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>RIB_OUTPUT_LEVEL</i> = 0</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>CHECK_GEOM</i> = 1</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>KEEP_CUTS</i> = 0</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>AVERAGE_CUTS</i> = 0</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>REDUCE_DIMENSIONS</i> = 0</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><i>DEGENERATE_RATIO</i> = 10</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td VALIGN=TOP><b>Required Query Functions:</b></td>
|
||
|
|
|
||
|
|
<td></td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><b><a href="ug_query_lb.html#ZOLTAN_NUM_OBJ_FN">ZOLTAN_NUM_OBJ_FN</a></b></td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><b><a href="ug_query_lb.html#ZOLTAN_OBJ_LIST_FN">ZOLTAN_OBJ_LIST_FN</a></b>
|
||
|
|
</td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td><b><a href="ug_query_lb.html#ZOLTAN_NUM_GEOM_FN">ZOLTAN_NUM_GEOM_FN</a></b></td>
|
||
|
|
</tr>
|
||
|
|
|
||
|
|
<tr>
|
||
|
|
<td></td>
|
||
|
|
|
||
|
|
<td>
|
||
|
|
<b><a href="ug_query_lb.html#ZOLTAN_GEOM_MULTI_FN">ZOLTAN_GEOM_MULTI_FN</a></b>
|
||
|
|
or <b><a href="ug_query_lb.html#ZOLTAN_GEOM_FN">ZOLTAN_GEOM_FN</a></b>
|
||
|
|
</td>
|
||
|
|
|
||
|
|
</tr>
|
||
|
|
</table>
|
||
|
|
|
||
|
|
<p>
|
||
|
|
<hr WIDTH="100%">[<a href="ug.html">Table of Contents</a> |
|
||
|
|
<a href="ug_alg_hsfc.html">Next:
|
||
|
|
Hilbert Space-Filling Curve Partitioning</a> | <a href="ug_alg_rcb.html">Previous:
|
||
|
|
Recursive Coordinate Bisection (RCB)</a> | <a href="https://www.sandia.gov/general/privacy-security/index.html">Privacy and Security</a>]
|
||
|
|
</body>
|
||
|
|
</html>
|