File: MATCOLORINGGREEDY.html

package info (click to toggle)
petsc 3.7.5%2Bdfsg1-4
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 163,864 kB
  • ctags: 618,438
  • sloc: ansic: 515,133; python: 29,793; makefile: 20,458; fortran: 18,998; cpp: 6,515; f90: 3,914; sh: 1,012; xml: 621; objc: 445; csh: 240; java: 13
file content (36 lines) | stat: -rw-r--r-- 2,648 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML3.2 EN">
<HTML>
<HEAD> <link rel="canonical" href="http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/MatOrderings/MATCOLORINGGREEDY.html" />
<META NAME="GENERATOR" CONTENT="DOCTEXT">
<TITLE>MATCOLORINGGREEDY</TITLE>
</HEAD>
<BODY BGCOLOR="FFFFFF">
   <div id="version" align=right><b>petsc-3.7.5 2017-01-01</b></div>
   <div id="bugreport" align=right><a href="mailto:petsc-maint@mcs.anl.gov?subject=Typo or Error in Documentation &body=Please describe the typo or error in the documentation: petsc-3.7.5 v3.7.5 docs/manualpages/MatOrderings/MATCOLORINGGREEDY.html "><small>Report Typos and Errors</small></a></div>
<A NAME="MATCOLORINGGREEDY"><H1>MATCOLORINGGREEDY</H1></A>
Greedy-with-conflict correction based Matrix Coloring for distance 1 and 2. 
<P>
<H3><FONT COLOR="#CC3333">Notes</FONT></H3>
<P>
These algorithms proceed in two phases -- local coloring and conflict resolution.  The local coloring
tentatively colors all vertices at the distance required given what's known of the global coloring.  Then,
the updated colors are transferred to different processors at distance one.  In the distance one case, each
vertex with nonlocal neighbors is then checked to see if it conforms, with the vertex being
marked for recoloring if its lower weight than its same colored neighbor.  In the distance two case,
each boundary vertex's immediate star is checked for validity of the coloring.  Lower-weight conflict
vertices are marked, and then the conflicts are gathered back on owning processors.  In both cases
this is done until each column has received a valid color.
<P>
<H3><FONT COLOR="#CC3333">References</FONT></H3>
<DT><B>1. </B> -Bozdag et al. "A Parallel Distance 2 Graph Coloring Algorithm for Distributed Memory Computers"
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
<br>
<P>
<H3><FONT COLOR="#CC3333">See Also</FONT></H3>
 <A HREF="../MatOrderings/MatColoringCreate.html#MatColoringCreate">MatColoringCreate</A>(), <A HREF="../Mat/MatColoring.html#MatColoring">MatColoring</A>, <A HREF="../MatOrderings/MatColoringSetType.html#MatColoringSetType">MatColoringSetType</A>()
<BR><P><B><P><B><FONT COLOR="#CC3333">Level:</FONT></B>beginner
<BR><FONT COLOR="#CC3333">Location:</FONT></B><A HREF="../../../src/mat/color/impls/greedy/greedy.c.html#MATCOLORINGGREEDY">src/mat/color/impls/greedy/greedy.c</A>
<BR><A HREF="./index.html">Index of all MatOrderings routines</A>
<BR><A HREF="../../index.html">Table of Contents for all manual pages</A>
<BR><A HREF="../singleindex.html">Index of all manual pages</A>
</BODY></HTML>