1
2amk_ccc(1)                   Scotch user's manual                   amk_ccc(1)
3
4
5

NAME

7       amk_ccc, amk_fft2, amk_hy, amk_m2, amk_p2 - create target architectures
8

SYNOPSIS

10       amk_ccc [options] dim [tfile]
11
12       amk_fft2 [options] dim [tfile]
13
14       amk_hy [options] dim [tfile]
15
16       amk_m2 [options] dimX [dimY] [tfile]
17
18       amk_p2 [options] [wght0] [wght1] [tfile]
19

DESCRIPTION

21       The  amk_*  programs  create target architecture files for some common,
22       regular topologies.
23
24       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
29       amk_fft2  creates a decomposition-defined fast-Fourier-transform topol‐
30       ogy of dimension dim.  The  decomposition  is  performed  by  recursive
31       bisection of the vertices, by descending dimension (that is, bit number
32       in the labeling of the vertices).
33
34       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
41       amk_m2  creates  a  decomposition-defined  2D  regular grid topology of
42       dimensions 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
45       experimentation  purposes, this program is deprecated, as the algorith‐
46       mically-defined 'mesh2D' and 'mesh3D' target architectures are  a  more
47       convenient and efficient way to represent 2D and 3D grid architectures.
48
49       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

OPTIONS

55       -mmeth For amk_m2 only. Perform either recursive dissection or  one-way
56              dissection, according to the given method flag:
57
58              n      perform nested dissection (default).
59
60              o      perform one-way dissection (cut across Y, then X).
61
62       -h     Display some help.
63
64       -V     Display program version and copyright.
65

EXAMPLE

67       Create  a  cube-connected-cycle target architecture of dimension 4, and
68       save it to file 'ccc4.tgt'.
69
70           $ amk_ccc 4 ccc4.tgt
71
72       Run gmap to compute a bisection, into two parts of respective weights 3
73       and  5,  of  graph  'brol.grf'  and  save the resulting mapping to file
74       'brol.map'. The dash '-' standard file name is used so that the  target
75       architecture  description  is read from the standard input, through the
76       pipe.
77
78           $ amk_p2 3 5 | gmap brol.grf - brol.map
79
80

SEE ALSO

82       gmk_msh(1), gtst(1), gmap(1), gord(1), gout(1), amk_grf(1).
83
84       Scotch user's manual.
85

AUTHOR

87       Francois Pellegrini <francois.pellegrini@labri.fr>
88
89
90
91                                August 03, 2010                     amk_ccc(1)
Impressum