Files
ThirdParty-6/scotch_6.0.3/man/man1/amk_ccc.1
Henry Weller 1cce60aa78 scotch_6.0.3: Added to the source tree to simplify building OpenFOAM
Recent versions of scotch are rarely available in packaged form for
ready installation on GNU/Linux distributions and so the sources are
generally required.
2016-05-30 21:17:14 +01:00

108 lines
3.4 KiB
Groff
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

." Text automatically generated by txt2man
.TH amk_ccc 1 "August 03, 2010" "" "Scotch user's manual"
.SH NAME
\fBamk_ccc, amk_fft2, amk_hy, amk_m2, amk_p2 \fP- create target architectures
\fB
.SH SYNOPSIS
.nf
.fam C
\fBamk_ccc\fP [\fIoptions\fP] \fIdim\fP [\fItfile\fP]
.PP
\fBamk_fft2\fP [\fIoptions\fP] \fIdim\fP [\fItfile\fP]
.PP
\fBamk_hy\fP [\fIoptions\fP] \fIdim\fP [\fItfile\fP]
.PP
\fBamk_m2\fP [\fIoptions\fP] \fIdimX\fP [\fIdimY\fP] [\fItfile\fP]
.PP
\fBamk_p2\fP [\fIoptions\fP] [\fIwght0\fP] [\fIwght1\fP] [\fItfile\fP]
.fam T
.fi
.SH DESCRIPTION
The amk_* programs create target architecture files for some common,
regular topologies.
.PP
\fBamk_ccc\fP creates a decomposition-defined cube-connected-cycle
topology of dimension \fIdim\fP. The decomposition is performed first by
bisection along the dimensions of the hypercube, then along the
remaining cycle graphs.
.PP
\fBamk_fft2\fP creates a decomposition-defined fast-Fourier-transform
topology of dimension \fIdim\fP. The decomposition is performed by
recursive bisection of the vertices, by descending dimension
(that is, bit number in the labeling of the vertices).
.PP
\fBamk_hy\fP creates a decomposition-defined hypercube topology of
dimension \fIdim\fP. The decomposition is performed by
recursive bisection of the vertices, by descending dimension
(that is, bit number in the labeling of the vertices). Save for
experimentation purposes, this program is deprecated, as the
algorithmically-defined 'hcub' target architecture is a more
convenient and efficient way to represent hypercube architectures.
.PP
\fBamk_m2\fP creates a decomposition-defined 2D regular grid topology of
dimensions \fIdimX\fP and \fIdimY\fP. The decomposition is performed by
recursive splitting along the dimensions, either by cutting the
longest one, or by one-way dissection, depending on the '\fB-m\fP' option
flag. Save for experimentation purposes, this program is deprecated,
as the algorithmically-defined 'mesh2D' and 'mesh3D' target
architectures are a more convenient and efficient way to represent
2D and 3D grid architectures.
.PP
\fBamk_p2\fP creates a weighted path graph topology comprising only two
vertices of weights \fIwght0\fP and \fIwght1\fP. This is just a helper program,
which builds a 'wcmplt' algorithmically-defined complete graph with
two vertices. It may be used to compute weighted bisections of a
graph.
.SH OPTIONS
.TP
.B
\fB-m\fP\fImeth\fP
For \fBamk_m2\fP only. Perform either recursive dissection or
one-way dissection, according to the given method flag:
.RS
.TP
.B
n
perform nested dissection (default).
.TP
.B
o
perform one-way dissection (cut across Y, then X).
.RE
.TP
.B
\fB-h\fP
Display some help.
.TP
.B
\fB-V\fP
Display program version and copyright.
.SH EXAMPLE
Create a cube-connected-cycle target architecture of dimension 4,
and save it to file 'ccc4.tgt'.
.PP
.nf
.fam C
$ amk_ccc 4 ccc4.tgt
.fam T
.fi
Run gmap to compute a bisection, into two parts of respective weights
3 and 5, of graph 'brol.grf' and save the resulting mapping to
file 'brol.map'. The dash '-' standard file name is used so that the
target architecture description is read from the standard input,
through the pipe.
.PP
.nf
.fam C
$ amk_p2 3 5 | gmap brol.grf - brol.map
.fam T
.fi
.SH SEE ALSO
\fBgmk_msh\fP(1), \fBgtst\fP(1), \fBgmap\fP(1), \fBgord\fP(1), \fBgout\fP(1), \fBamk_grf\fP(1).
.PP
Scotch user's manual.
.SH AUTHOR
Francois Pellegrini <francois.pellegrini@labri.fr>