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.
497 lines
17 KiB
497 lines
17 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
|
|
------->
|
|
|
|
<HTML>
|
|
<HEAD>
|
|
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
|
|
<META NAME="GENERATOR" CONTENT="Mozilla/4.04 [en] (X11; U; SunOS 4.1.3_U1 sun4m) [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: Augmenting a Decomposition</TITLE>
|
|
</HEAD>
|
|
<BODY BGCOLOR="#FFFFFF">
|
|
|
|
<div ALIGN=right><b><i><a href="ug.html">Zoltan User's Guide</a> | <a href="ug_interface_mig.html">Next</a> | <a href="ug_interface_lb.html">Previous</a></i></b></div>
|
|
|
|
|
|
<H2>
|
|
Functions for Augmenting a Decomposition</H2>
|
|
The following functions support the addition of new items to an existing
|
|
decomposition. Given a decomposition, they determine to which processor(s)
|
|
a new item should be assigned. Currently, they work in conjunction with
|
|
only the
|
|
<A HREF="ug_alg_rcb.html">RCB</A>,
|
|
<a href="ug_alg_rib.html">RIB</a>, and
|
|
<A HREF="ug_alg_hsfc.html">HSFC</A>
|
|
algorithms.
|
|
<BLOCKQUOTE>
|
|
<B><A HREF="#Zoltan_LB_Point_PP_Assign">Zoltan_LB_Point_PP_Assign</A></B>
|
|
<BR><B><A HREF="#Zoltan_LB_Box_PP_Assign">Zoltan_LB_Box_PP_Assign</A></B>
|
|
</BLOCKQUOTE>
|
|
|
|
For <a href="ug_backward.html">backward compatibility</a>
|
|
with previous versions of Zoltan, the following
|
|
functions are also maintained.
|
|
These functions are applicable only when the
|
|
number of parts to be generated is equal to the number of processors on
|
|
which the parts are computed. That is, these functions assume "parts"
|
|
and "processors" are synonymous.
|
|
<blockquote>
|
|
<B><A HREF="#Zoltan_LB_Point_Assign">Zoltan_LB_Point_Assign</A></B>
|
|
<BR><B><A HREF="#Zoltan_LB_Box_Assign">Zoltan_LB_Box_Assign</A></B>
|
|
</blockquote>
|
|
|
|
|
|
<!------------------------------------------------------------------------->
|
|
<HR WIDTH="100%">
|
|
<A NAME="Zoltan_LB_Point_PP_Assign"></A>
|
|
<HR WIDTH="100%">
|
|
<TABLE WIDTH="100%" NOSAVE >
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP NOSAVE>C:</TD>
|
|
|
|
<TD WIDTH="85%">
|
|
int <B>Zoltan_LB_Point_PP_Assign</B> (
|
|
<br> struct <B>Zoltan_Struct</B>
|
|
* <I>zz</I>,
|
|
<br> double * <I>coords</I>,
|
|
<br> int * <I>proc</I>,
|
|
<br> int * <I>part</I>
|
|
);
|
|
</TD>
|
|
</TR>
|
|
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP WIDTH="15%" NOSAVE>FORTRAN:</TD>
|
|
|
|
<TD> FUNCTION <B>Zoltan_LB_Point_PP_Assign</B>(<I>zz, coords, proc, part</I>)
|
|
<BR> INTEGER(Zoltan_INT) :: Zoltan_LB_Point_PP_Assign
|
|
<BR> TYPE(Zoltan_Struct), INTENT(IN) :: zz
|
|
<BR> REAL(Zoltan_DOUBLE), DIMENSION(*), INTENT(IN) :: coords
|
|
<BR> INTEGER(Zoltan_INT), INTENT(OUT) :: proc
|
|
<BR> INTEGER(Zoltan_INT), INTENT(OUT) :: part </TD>
|
|
</TR>
|
|
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP NOSAVE>C++:</TD>
|
|
|
|
<TD WIDTH="85%">
|
|
int <B>Zoltan::LB_Point_PP_Assign</B> (
|
|
<br> double * const <I>coords</I>,
|
|
<br> int & <I>proc</I>,
|
|
<br> int & <I>part</I>
|
|
);
|
|
</TD>
|
|
</TR>
|
|
</TABLE>
|
|
|
|
<HR WIDTH="100%"><B>Zoltan_LB_Point_PP_Assign</B> is used to determine to
|
|
which processor and parts
|
|
a new point should be assigned. It is applicable only to geometrically
|
|
generated decompositions
|
|
(<A HREF="ug_alg_rcb.html">RCB</A>,
|
|
<a href="ug_alg_rib.html">RIB</a>, and
|
|
<A HREF="ug_alg_hsfc.html">HSFC</A>).
|
|
If the parameter <B>KEEP_CUTS</B>
|
|
is set to TRUE, then the sequence of cuts that define the
|
|
decomposition is saved. Given a new geometric point, the processor and
|
|
parts which
|
|
own it can be determined.
|
|
<BR>
|
|
<TABLE WIDTH="100%" >
|
|
<TR>
|
|
<TD VALIGN=TOP WIDTH="20%"><B>Arguments:</B></TD>
|
|
<td WIDTH="80%"></td>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD><I> zz</I></TD>
|
|
|
|
<TD>Pointer to the Zoltan structure created by <B><A HREF="ug_interface_init.html#Zoltan_Create">Zoltan_Create</A></B>.</TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> coords</I></TD>
|
|
|
|
<TD>The <I>(x,y)</I> or <I>(x,y,z)</I> coordinates of the point being assigned.</TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> proc</I></TD>
|
|
|
|
<TD>Upon return, the ID of the processor to which the point should belong.</TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> part</I></TD>
|
|
|
|
<TD>Upon return, the ID of the parts to which the point should belong.</TD>
|
|
</TR>
|
|
<TR>
|
|
<TD><B>Returned Value:</B></TD>
|
|
|
|
<TD></TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP> int</TD>
|
|
|
|
<TD><A HREF="ug_interface.html#Error Codes">Error code</A>.</TD>
|
|
</TR>
|
|
</TABLE>
|
|
|
|
<!------------------------------------------------------------------------->
|
|
<HR WIDTH="100%">
|
|
<A NAME="Zoltan_LB_Box_PP_Assign"></A>
|
|
<HR WIDTH="100%">
|
|
<TABLE WIDTH="100%" NOSAVE >
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP NOSAVE>C:</TD>
|
|
|
|
<TD WIDTH="85%">
|
|
int <B>Zoltan_LB_Box_PP_Assign</B> (
|
|
<br> struct <B>Zoltan_Struct</B> *<I> zz</I>,
|
|
<br> double <I>xmin</I>,
|
|
<br> double <I>ymin</I>,
|
|
<br> double <I>zmin</I>,
|
|
<br> double <I>xmax</I>,
|
|
<br> double <I>ymax</I>,
|
|
<br> double <I>zmax</I>,
|
|
<br> int *<I>procs</I>,
|
|
<br> int *<I>numprocs</I>,
|
|
<br> int *<I>parts</I>,
|
|
<br> int *<I>numparts</I>);
|
|
</TD>
|
|
</TR>
|
|
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP WIDTH="15%" NOSAVE>FORTRAN:</TD>
|
|
|
|
<TD> FUNCTION <B>Zoltan_LB_Box_PP_Assign</B>(<I>zz,
|
|
xmin, ymin, zmin, xmax, ymax,
|
|
zmax, procs, numprocs, parts, numparts</I>)
|
|
<BR> INTEGER(Zoltan_INT) :: Zoltan_LB_Box_PP_Assign
|
|
<BR> TYPE(Zoltan_Struct), INTENT(IN) :: zz
|
|
<BR> REAL(Zoltan_DOUBLE), INTENT(IN) :: xmin, ymin, zmin, xmax, ymax, zmax
|
|
<BR> INTEGER(Zoltan_INT), DIMENSION(*), INTENT(OUT) ::procs
|
|
<BR> INTEGER(Zoltan_INT), INTENT(OUT) :: numprocs
|
|
<BR> INTEGER(Zoltan_INT), DIMENSION(*), INTENT(OUT) ::parts
|
|
<BR> INTEGER(Zoltan_INT), INTENT(OUT) :: numparts
|
|
</TD>
|
|
</TR>
|
|
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP NOSAVE>C++:</TD>
|
|
|
|
<TD WIDTH="85%">
|
|
int <B>Zoltan::LB_Box_PP_Assign</B> (
|
|
<br> const double & <I>xmin</I>,
|
|
<br> const double & <I>ymin</I>,
|
|
<br> const double & <I>zmin</I>,
|
|
<br> const double & <I>xmax</I>,
|
|
<br> const double & <I>ymax</I>,
|
|
<br> const double & <I>zmax</I>,
|
|
<br> int * const <I>procs</I>,
|
|
<br> int & <I>numprocs</I>,
|
|
<br> int * const <I>parts</I>,
|
|
<br> int & <I>numparts</I>);
|
|
</TD>
|
|
</TR>
|
|
</TABLE>
|
|
|
|
<HR WIDTH="100%">In many settings, it is useful to know which processors
|
|
and parts
|
|
might need to know about an extended geometric object. <B>Zoltan_LB_Box_PP_Assign</B>
|
|
addresses this problem. Given a geometric decomposition of space (currently
|
|
only
|
|
<A HREF="ug_alg_rcb.html">RCB</A>,
|
|
<a href="ug_alg_rib.html">RIB</a>, and
|
|
<a href="ug_alg_hsfc.html">HSFC</a> are
|
|
supported), and given an axis-aligned box around the geometric
|
|
object, <B>Zoltan_LB_Box_PP_Assign</B> determines which processors and
|
|
parts own geometry that
|
|
intersects the box. To use this routine, the parameter <B>KEEP_CUTS</B>
|
|
must be set to TRUE when the decomposition is generated. This parameter
|
|
will cause the sequence of geometric cuts to be saved, which
|
|
is necessary for <B>Zoltan_LB_Box_PP_Assign</B> to do its job.
|
|
<p>
|
|
Note that if the parameter <B>REDUCE_DIMENSIONS</B> was set to TRUE and
|
|
the geometry was determined to be degenerate when decomposition was
|
|
calculated, then the calculation was performed on transformed
|
|
coordinates. This means that <B>Zoltan_LB_Box_PP_Assign</B>
|
|
must transform the supplied bounding box accordingly.
|
|
The transformed vertices are bounded again,
|
|
and the parts intersections are calculated in the transformed
|
|
space on this new bounding box.
|
|
The impact of this is that <B>Zoltan_LB_Box_PP_Assign</B> may return
|
|
parts not actually intersecting the original bounding box, but
|
|
it will not omit any parts intersecting the original bounding
|
|
box.
|
|
<BR>
|
|
|
|
<P>
|
|
<TABLE WIDTH="100%" >
|
|
<TR>
|
|
<TD VALIGN=TOP WIDTH="20%"><B>Arguments:</B></TD>
|
|
<td WIDTH="80%"></td>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD><I> zz</I></TD>
|
|
|
|
<TD>Pointer to the Zoltan structure created by <B><A HREF="ug_interface_init.html#Zoltan_Create">Zoltan_Create</A></B>.</TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> xmin, ymin, zmin</I></TD>
|
|
|
|
<TD>The coordinates of the lower extent of the bounding box around the
|
|
object. If the geometry is two-dimensional, the <i>z</i> value
|
|
is ignored. </TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> xmax, ymax, zmax</I></TD>
|
|
|
|
<TD>The coordinates of the upper extent of the bounding box around the
|
|
object. If the geometry is two-dimensional, the <i>z</i> value
|
|
is ignored. </TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> procs</I></TD>
|
|
|
|
<TD>The list of processors intersecting the box are returned starting at
|
|
this address. Note that <i>it is the responsibility of the calling routine
|
|
to ensure that there is sufficient space for the return list.</i> </TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> numprocs</I></TD>
|
|
|
|
<TD>Upon return, this value contains the number of processors that intersect
|
|
the box (i.e. the number of entries placed in the <I>procs</I> list). </TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> parts</I></TD>
|
|
|
|
<TD>The list of parts intersecting the box are returned starting at
|
|
this address. Note that <i>it is the responsibility of the calling routine
|
|
to ensure that there is sufficient space for the return list.</i> </TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP><I> numparts</I></TD>
|
|
|
|
<TD>Upon return, this value contains the number of parts that intersect
|
|
the box (i.e. the number of entries placed in the <I>parts</I> list). </TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD><B>Returned Value:</B></TD>
|
|
|
|
<TD></TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP> int</TD>
|
|
|
|
<TD><A HREF="ug_interface.html#Error Codes">Error code</A>.</TD>
|
|
</TR>
|
|
</TABLE>
|
|
|
|
<!------------------------------------------------------------------------->
|
|
<HR WIDTH="100%">
|
|
<A NAME="Zoltan_LB_Point_Assign"></A>
|
|
<HR WIDTH="100%">
|
|
<TABLE WIDTH="100%" NOSAVE >
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP NOSAVE>C:</TD>
|
|
|
|
<TD WIDTH="85%">
|
|
int <B>Zoltan_LB_Point_Assign</B> (
|
|
<br> struct <B>Zoltan_Struct</B>
|
|
* <I>zz</I>,
|
|
<br> double * <I>coords</I>,
|
|
<br> int * <I>proc</I>);
|
|
</TD>
|
|
</TR>
|
|
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP WIDTH="15%" NOSAVE>FORTRAN:</TD>
|
|
|
|
<TD> FUNCTION <B>Zoltan_LB_Point_Assign</B>(<I>zz, coords, proc</I>)
|
|
<BR> INTEGER(Zoltan_INT) :: Zoltan_LB_Point_Assign
|
|
<BR> TYPE(Zoltan_Struct), INTENT(IN) :: zz
|
|
<BR> REAL(Zoltan_DOUBLE), DIMENSION(*), INTENT(IN) :: coords
|
|
<BR> INTEGER(Zoltan_INT), INTENT(OUT) :: proc </TD>
|
|
</TR>
|
|
|
|
</TABLE>
|
|
|
|
<HR WIDTH="100%"><B>Zoltan_LB_Point_Assign</B> is
|
|
is a wrapper around
|
|
<a href="#Zoltan_LB_Point_PP_Assign"><b>Zoltan_LB_Point_PP_Assign</b></a>
|
|
that excludes
|
|
the parts assignment results. <b>Zoltan_LB_Point_Assign</b> assumes the
|
|
number of parts is equal to the number of processors; thus, the
|
|
parts assignment is equivalent to the processor assignment.
|
|
<BR>
|
|
<TABLE WIDTH="100%" >
|
|
<TR>
|
|
<TD VALIGN=TOP WIDTH="20%"><B>Arguments:</B></TD>
|
|
<td WIDTH="80%"></td>
|
|
</TR>
|
|
|
|
<tr>
|
|
<td VALIGN=TOP></td>
|
|
|
|
<td>All arguments are analogous to those in
|
|
<a href="#Zoltan_LB_Point_PP_Assign"><b>Zoltan_LB_Point_PP_Assign</b></a>.
|
|
Parts-assignment argument <i>part</i>
|
|
is not included, as processor and parts
|
|
numbers are considered to be the same in <b>Zoltan_LB_Point_Assign</b>.
|
|
</td>
|
|
</tr>
|
|
|
|
<TR>
|
|
<TD><B>Returned Value:</B></TD>
|
|
|
|
<TD></TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP> int</TD>
|
|
|
|
<TD><A HREF="ug_interface.html#Error Codes">Error code</A>.</TD>
|
|
</TR>
|
|
</TABLE>
|
|
|
|
<!------------------------------------------------------------------------->
|
|
<HR WIDTH="100%">
|
|
<A NAME="Zoltan_LB_Box_Assign"></A>
|
|
<HR WIDTH="100%">
|
|
<TABLE WIDTH="100%" NOSAVE >
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP NOSAVE>C:</TD>
|
|
|
|
<TD WIDTH="85%">
|
|
int <B>Zoltan_LB_Box_Assign</B> (
|
|
<br> struct <B>Zoltan_Struct</B> *<I> zz</I>,
|
|
<br> double <I>xmin</I>,
|
|
<br> double <I>ymin</I>,
|
|
<br> double <I>zmin</I>,
|
|
<br> double <I>xmax</I>,
|
|
<br> double <I>ymax</I>,
|
|
<br> double <I>zmax</I>,
|
|
<br> int *<I>procs</I>,
|
|
<br> int *<I>numprocs</I>);
|
|
</TD>
|
|
</TR>
|
|
|
|
<TR NOSAVE>
|
|
<TD VALIGN=TOP WIDTH="15%" NOSAVE>FORTRAN:</TD>
|
|
|
|
<TD> FUNCTION <B>Zoltan_LB_Box_Assign</B>(<I>zz, xmin, ymin, zmin, xmax, ymax,
|
|
zmax, procs, numprocs</I>)
|
|
<BR> INTEGER(Zoltan_INT) :: Zoltan_LB_Box_Assign
|
|
<BR> TYPE(Zoltan_Struct), INTENT(IN) :: zz
|
|
<BR> REAL(Zoltan_DOUBLE), INTENT(IN) :: xmin, ymin, zmin, xmax, ymax, zmax
|
|
<BR> INTEGER(Zoltan_INT), DIMENSION(*), INTENT(OUT) ::procs
|
|
<BR> INTEGER(Zoltan_INT), INTENT(OUT) :: numprocs </TD>
|
|
</TR>
|
|
|
|
</TABLE>
|
|
|
|
<HR WIDTH="100%">
|
|
<b>Zoltan_LB_Box_Assign</b> is a wrapper around
|
|
<a href="#Zoltan_LB_Box_PP_Assign"><b>Zoltan_LB_Box_PP_Assign</b></a>
|
|
that excludes
|
|
the parts assignment results. <b>Zoltan_LB_Box_Assign</b> assumes the
|
|
number of parts is equal to the number of processors; thus, the
|
|
parts assignment is equivalent to the processor assignment.
|
|
|
|
<P>
|
|
<TABLE WIDTH="100%" >
|
|
<TR>
|
|
<TD VALIGN=TOP WIDTH="20%"><B>Arguments:</B></TD>
|
|
<td WIDTH="80%"></td>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD></TD>
|
|
|
|
<td>All arguments are analogous to those in
|
|
<a href="#Zoltan_LB_Box_PP_Assign"><b>Zoltan_LB_Box_PP_Assign</b></a>.
|
|
Parts-assignment arguments <i>parts</i> and <i>numparts</i>
|
|
are not included, as processor and parts
|
|
numbers are considered to be the same in <b>Zoltan_LB_Box_Assign</b>.
|
|
</td>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD><B>Returned Value:</B></TD>
|
|
|
|
<TD></TD>
|
|
</TR>
|
|
|
|
<TR>
|
|
<TD VALIGN=TOP> int</TD>
|
|
|
|
<TD><A HREF="ug_interface.html#Error Codes">Error code</A>.</TD>
|
|
</TR>
|
|
</TABLE>
|
|
|
|
<!------------------------------------------------------------------------->
|
|
|
|
<HR WIDTH="100%">[<A HREF="ug.html">Table of Contents</A> |
|
|
<A HREF="ug_interface_mig.html">Next: Migration Functions</A>
|
|
| <A HREF="ug_interface_lb.html">Previous: Load-Balancing Functions</A> | <a href="https://www.sandia.gov/general/privacy-security/index.html">Privacy and Security</a>]
|
|
</BODY>
|
|
</HTML>
|
|
|