1amk_ccc(1) Scotch user's manual amk_ccc(1)
2
6 amk_ccc, amk_fft2, amk_hy, amk_m2, amk_p2 - create target architectures
7
9 amk_ccc [options] dim [tfile]
10 amk_fft2 [options] dim [tfile]
12 amk_hy [options] dim [tfile]
14 amk_m2 [options] dimX [dimY] [tfile]
16 amk_p2 [options] [wght0] [wght1] [tfile]
18
21 The amk_* programs create target architecture files for some common,
22 regular topologies.
23 amk_ccc creates a decomposition-defined cube-connected-cycle topology
25 of dimension dim. The decomposition is performed first by bisection
26 along the dimensions of the hypercube, then along the remaining cycle
27 graphs.
28 amk_fft2 creates a decomposition-defined fast-Fourier-transform topol‐
30 ogy of dimension dim. The decomposition is performed by recursive bi‐
31 section of the vertices, by descending dimension (that is, bit number
32 in the labeling of the vertices).
33 amk_hy creates a decomposition-defined hypercube topology of dimension
35 dim. The decomposition is performed by recursive bisection of the ver‐
36 tices, by descending dimension (that is, bit number in the labeling of
37 the vertices). Save for experimentation purposes, this program is dep‐
38 recated, as the algorithmically-defined 'hcub' target architecture is a
39 more convenient and efficient way to represent hypercube architectures.
40 amk_m2 creates a decomposition-defined 2D regular grid topology of di‐
42 mensions dimX and dimY. The decomposition is performed by recursive
43 splitting along the dimensions, either by cutting the longest one, or
44 by one-way dissection, depending on the '-m' option flag. Save for ex‐
45 perimentation purposes, this program is deprecated, as the algorithmi‐
46 cally-defined 'mesh2D' and 'mesh3D' target architectures are a more
47 convenient and efficient way to represent 2D and 3D grid architectures.
48 amk_p2 creates a weighted path graph topology comprising only two ver‐
50 tices of weights wght0 and wght1. This is just a helper program, which
51 builds a 'wcmplt' algorithmically-defined complete graph with two ver‐
52 tices. It may be used to compute weighted bisections of a graph.
53 When the proper libraries have been included at compile time, the amk_*
55 programs can directly handle compressed files, both as input and out‐
56 put. A stream is treated as compressed whenever its name is postfixed
57 with a compressed file extension, such as in 'brol.tgt.bz2' or '-.gz'.
58 The compression formats which can be supported are the bzip2 format
59 ('.bz2'), the gzip format ('.gz'), and the lzma format ('.lzma').
60
62 -mmeth For amk_m2 only. Perform either recursive dissection or one-way
63 dissection, according to the given method flag:
64 n perform nested dissection (default).
66 o perform one-way dissection (cut across Y, then X).
68 -h Display some help.
70 -V Display program version and copyright.
72
74 Create a cube-connected-cycle target architecture of dimension 4, and
75 save it to file 'ccc4.tgt'.
76 $ amk_ccc 4 ccc4.tgt
78 Run gmap to compute a bisection, into two parts of respective weights 3
80 and 5, of graph 'brol.grf' and save the resulting mapping to file
81 'brol.map'. The dash '-' standard file name is used so that the target
82 architecture description is read from the standard input, through the
83 pipe.
84 $ amk_p2 3 5 | gmap brol.grf - brol.map
86
89 acpl(1), atst(1), amk_grf(1), dgmap(1), gmap(1).
90 Scotch user's manual.
92
94 Francois Pellegrini <francois.pellegrini@labri.fr>
95 23 November 2019 amk_ccc(1)