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.
262 lines
11 KiB
262 lines
11 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.6 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: References</title>
|
||
|
|
|
||
|
|
</head>
|
||
|
|
<body bgcolor="#FFFFFF">
|
||
|
|
|
||
|
|
<div align=right><b><i><a href="ug.html">Zoltan User's Guide</a> | <a href="ug_index.html">Next</a> | <a href="ug_backward.html">Previous</a></i></b></div>
|
||
|
|
|
||
|
|
<h2>
|
||
|
|
<a NAME="References"></a>References</h2>
|
||
|
|
|
||
|
|
<ol>
|
||
|
|
<li>
|
||
|
|
<a NAME="alegra"></a>"ALEGRA -- A Framework for Large Strain Rate Physics."
|
||
|
|
<a href="https://sherpa.sandia.gov/9231home/alegra/alegra-frame.html">https://sherpa.sandia.gov/9231home/alegra/alegra-frame.html</a></li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="attaway"></a>S. Attaway, T. Barragy, K. Brown, D. Gardner, B.
|
||
|
|
Hendrickson, S. Plimpton and C. Vaughan. "Transient Solid Dynamics Simulations
|
||
|
|
on the Sandia/Intel Teraflop Computer." <i>Proceedings of SC'97</i>, San
|
||
|
|
Jose, CA, November, 1997. (Finalist for the Gordon Bell Prize.)</li>
|
||
|
|
|
||
|
|
<a NAME="catalyurek99"></a>U. Catalyurek and C. Aykanat,
|
||
|
|
"Hypergraph-partitioning-based decomposition for parallel
|
||
|
|
sparse matrix vector multiplication", <i>IEEE Trans. Parallel Dist. Systems</i>,
|
||
|
|
v. 10, no. 7, (1999) pp. 673--693.
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="baehmann"></a>P. Baehmann, S. Wittchen, M. Shephard, K. Grice,
|
||
|
|
and M. Yerry. "Robust geometrically based automatic two-dimensional mesh
|
||
|
|
generation." <i>Intl. J. Numer. Meths. Engrg</i>., <i>24</i> (1987) 1043-1078.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="d1color"></a>E.G. Boman, D. Bozdag, U. Catalyurek,
|
||
|
|
A.H. Gebremedhin and F. Manne. "A Scalable Parallel Graph Coloring
|
||
|
|
Algorithm for Distributed Memory Computers". <i>Proceedings of Euro-Par'05</i>,
|
||
|
|
Lisbon, Portugal, August, 2005.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="d2color"></a>D. Bozdag, U. Catalyurek, A.H. Gebremedhin,
|
||
|
|
F. Manne, E.G. Boman and F. Ozguner. "A Parallel Distance-2 Graph
|
||
|
|
Coloring Algorithm for Distributed Memory Computers". <i>Proceedings of
|
||
|
|
HPCC'05</i>, Sorrento, Italy, September, 2005.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="berger"></a>M. Berger and S. Bokhari. "A partitioning strategy
|
||
|
|
for nonuniform problems on multiprocessors." <i>IEEE Trans. Computers</i>,
|
||
|
|
C-36 (1987) 570-580.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="culberson"></a>J. C. Culberson, “Iterated greedy graph
|
||
|
|
coloring and the difficulty landscape” <i>University of Alberta,
|
||
|
|
Tech. Rep. TR 92-07, Jun. 1992</i> </li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="hypergraph-ipdps06"></a>K.D. Devine, E.G. Boman, R. Heaphy,
|
||
|
|
R.H. Bisseling, U.V. Catalyurek. "Parallel Hypergraph Partitioning
|
||
|
|
for Scientific Computing", Proc. of IPDPS'06, Rhodos, Greece, April 2006.
|
||
|
|
</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="mpsalsa-gordonbell"></a>K. Devine, G. Hennigan, S. Hutchinson,
|
||
|
|
A. Salinger, J. Shadid, and R. Tuminaro. "High Performance MP Unstructured
|
||
|
|
Finite Element Simulation of Chemically Reacting Flows." <i>Proceedings
|
||
|
|
of SC'97</i>, San Jose, CA, November, 1997. (Finalist for the Gordon Bell
|
||
|
|
Prize.)</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<A NAME="adapt03"></a>K.D. Devine, E.G. Boman, R.T. Heaphy, B.A. Hendrickson,
|
||
|
|
J.D. Teresco, J. Faik, J.E. Flaherty, and L.G. Gervasio. "New
|
||
|
|
challenges in dynamic load balancing." Williams College Department of
|
||
|
|
Computer Science Technical Report CS-04-02, and Sandia Report SAND2004-1496J, Sandia National Laboratories, 2004.
|
||
|
|
Submitted to <i>Applied Numerical Mathematics</i>.</LI>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="edwards"></a>H.C. Edwards. <i>A parallel infrastructure for scalable
|
||
|
|
adaptive finite element methods and its application to least squares
|
||
|
|
C^(inf)</i> collocation. Ph.D. Dissertation, Univ. of Texas at Austin,
|
||
|
|
May, 1997.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<A NAME="cluster04">J. Faik, J.E. Flaherty, L.G. Gervasio, J.D. Teresco, K,D.
|
||
|
|
Devine, and E.G. Boman.
|
||
|
|
"A model for resource-aware load balancing on heterogeneous clusters."
|
||
|
|
Williams College Department of Computer Science Technical Report CS-04-03,
|
||
|
|
and Sandia Report SAND2004-2145C, Sandia National Laboratories, 2004.
|
||
|
|
<I>Presented at Cluster '04.</I>
|
||
|
|
</LI>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="flaherty"></a>J. Flaherty, R. Loy, M. Shephard, B. Szymanski,
|
||
|
|
J. Teresco and L. Ziantz. "Adaptive local refinement with octree load-balancing
|
||
|
|
for the parallel solution of three-dimensional conservation laws." <i>J.
|
||
|
|
Parallel Distrib. Comput.</i>, <i>47</i> (1998) 139-152.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="gervasio"></a>L. Gervasio. "Final Report." Summer project report,
|
||
|
|
Internal Memo, Department 9103, Sandia National Laboratories, August, 1998.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="hendrickson-devine"></a>B. Hendrickson and K. Devine. "Dynamic
|
||
|
|
load balancing in computational mechanics." <i>Comp. Meth. Appl. Mech.
|
||
|
|
Engrg.</i>, v. 184 (#2-4), p. 485-500, 2000.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="hendrickson-kolda"></a>B. Hendrickson and T.G. Kolda.
|
||
|
|
"Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel computation", <i>SIAM J. on Sci. Comp.</i>, v. 21, no. 6, 2001, pp. 2048-2072.
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="chaco"></a>B. Hendrickson and R. Leland. "The Chaco user's guide,
|
||
|
|
version 2.0." Tech. Rep. SAND 94-2692, Sandia National Laboratories, Albuquerque,
|
||
|
|
NM, October, 1994. <a href="http://cs.sandia.gov/CRF/chac.html">http://cs.sandia.gov/CRF/chac.html</a></li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="parmetis"></a>G. Karypis and V. Kumar. "ParMETIS: Parallel graph
|
||
|
|
partitioning and sparse matrix ordering library." Tech. Rep. 97-060, Department
|
||
|
|
of Computer Science, Univ. of Minnesota, 1997. <a href="https://www-users.cs.umn.edu/~karypis/metis/parmetis/">https://www-users.cs.umn.edu/~karypis/metis/parmetis/</a></li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="loy"></a>R. Loy. <i>Adaptive local refinement with octree load-balancing
|
||
|
|
for the parallel solution of three-dimensional conservation laws</i>. Ph.
|
||
|
|
D. Dissertation, Dept. of Computer Science, Rensselaer Polytechnic Institute,
|
||
|
|
May 1998.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="mitchell"></a>S. Mitchell and S. Vavasis. "Quality mesh generation
|
||
|
|
in three dimensions." <i>Proc. 8th ACM Symposium on Computational Geometry</i>,
|
||
|
|
ACM (1992) 212-221.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="f90gl"></a>W. F. Mitchell. "A Fortran 90 Interface for OpenGL:
|
||
|
|
Revised January 1998" NISTIR 6134 (1998).
|
||
|
|
<a href="https://math.nist.gov/~mitchell/papers/nistir6134.ps.gz">https://math.nist.gov/~mitchell/papers/nistir6134.ps.gz</a></li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="reftree"></a>
|
||
|
|
W.F. Mitchell. "A Refinement-tree Based Partitioning Method for Dynamic Load
|
||
|
|
Balancing with Adaptively Refined Grids."
|
||
|
|
<i>Journal of Parallel and Distributed Computing</i>, Volume 67, Issue 4,
|
||
|
|
April 2007, Pages 417-429. </li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="mpsalsa"></a>"MPSalsa: Massively Parallel Numerical Methods for
|
||
|
|
Advanced Simulation of Chemically Reacting Flows." <a href="http://cs.sandia.gov/CRF/MPSalsa/">http://cs.sandia.gov/CRF/MPSalsa/</a></li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="patra"></a>A. Patra and J. T. Oden. "Problem decomposition for
|
||
|
|
adaptive hp-finite element methods." <i>J. Computing Systems in Engrg.</i>,
|
||
|
|
6 (1995).</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="pilkington"></a>J. Pilkington and S. Baden. "Partitioning with
|
||
|
|
space-filling curves." Tech. Rep. CS94-349, Dept. of Computer Science and
|
||
|
|
Engineering, Univ. of California, San Diego, CA, 1994.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="sariyuce"></a>A. E. Sariyuce, E. Saule, U. V. Catalyurek. "Improving Graph
|
||
|
|
Coloring on Distributed Memory Parallel Computers" <i>Proceedings of the 18th Annual
|
||
|
|
International Conference on High Performance Computing (HiPC 2011)</i>, 2011, to appear.
|
||
|
|
|
||
|
|
</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="shephard"></a>M. Shephard and M. Georges. "Automatic three-dimensional
|
||
|
|
mesh generation by the finite octree technique." <i>Intl. J. Numer. Meths.
|
||
|
|
Engrg.</i>, 32 (1991) 709-749.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="taylor"></a>V. E. Taylor and B. Nour-Omid. "A Study of the Factorization
|
||
|
|
Fill-in for a Parallel Implementation of the Finite Element Method." <i>Intl.
|
||
|
|
J. Numer. Meths. Engrg.</i>, 37 (1994) 3809-3823.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<A NAME="cise-drum"></A>J. D. Teresco, J. Faik, and J. E. Flaherty. "Resource-Aware Scientific Computation on a Heterogeneous Cluster." <I>Computing in Science & Engineering</I>, To appear, 2005.
|
||
|
|
</LI>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<A NAME="para04"></A>J. D. Teresco, J. Faik, and J. E. Flaherty.
|
||
|
|
"Hierarchical Partitioning and Dynamic Load Balancing for Scientific
|
||
|
|
Computation." Williams College Department of Computer Science
|
||
|
|
Technical Report CS-04-04, and Sandia Report SAND2004-1559A, Sandia
|
||
|
|
National Laboratories, 2004. Submitted to <i>Proc. PARA'04 Workshop on
|
||
|
|
State-Of-The-Art in Scientific Computing.</I>
|
||
|
|
</LI>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="jostle"></a>C. Walshaw. "JOSTLE mesh partitioning software", <a href="https://www.gre.ac.uk/jostle/">https://www.gre.ac.uk/jostle/</a></li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="walshaw"></a>C. Walshaw, M. Cross, and M. Everett. "Parallel Dynamic
|
||
|
|
Graph Partitioning for Adaptive Unstructured Meshes", <i>J. Par. Dist.
|
||
|
|
Comp.</i>, 47(2) 102-108, 1997.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="warren"></a>M. Warren and J. Salmon. "A parallel hashed octree
|
||
|
|
n-body algorithm." <i>Proc. Supercomputing `93</i>, Portland, OR, November
|
||
|
|
1993.</li>
|
||
|
|
|
||
|
|
<li>
|
||
|
|
<a NAME="williams"></a>R. D. Williams. "Performance of dynamic load balancing algorithms for unstructured mesh calculations. <i>Concurrency, Practice, and Experience</i>, 3(5), 457-481, 1991.
|
||
|
|
</li>
|
||
|
|
|
||
|
|
</ol>
|
||
|
|
|
||
|
|
<hr WIDTH="100%">[<a href="ug.html">Table of Contents</a> | <a href="ug_index.html">Next: Index of Interface and Query Functions</a> | <a href="ug_backward.html">Previous: Backward Compatibility</a> | <a href="https://www.sandia.gov/general/privacy-security/index.html">Privacy and Security</a>]
|
||
|
|
|
||
|
|
</body>
|
||
|
|
</html>
|
||
|
|
|