Scotch Brand 5.1.10 User Manual

Page 30

Advertising
background image

However, compiled architecture files are read much more efficiently, as they are
directly loaded into memory without further processing. Since the compilation
time of a target architecture graph evolves as the square of its number of
vertices, precompiling with acpl can save some time when many mappings
are to be performed onto the same large target architecture.

Options

-h

Display the program synopsis.

-V

Print the program version and copyright.

6.3.2

amk

*

Synopsis

amk ccc dim

[output target file] options

amk fft2 dim

[output target file] options

amk hy dim

[output target file] options

amk m2 dimX

[dimY [output target file]] options

amk p2 weight0

[weight1 [output target file]] options

Description

The amk * programs make target graphs. Each of them is devoted to a
specific topology, for which it builds target graphs of any dimension.
These programs are an alternate way between algorithmically-coded built-in
target architectures and decompositions computed by mapping with amk grf.
Like built-in target architectures, their decompositions are algorithmically
computed, and like amk grf, their output is a decomposition-defined target
architecture file. These programs allow the definition and testing of new
algorithmically-coded target architectures without coding them in the core of
the mapper.

Program amk ccc outputs the target architecture file of a Cube-Connected-
Cycles graph of dimension dim.

Vertex (l, m) of CCC(dim), with

0 ≤ l < dim and 0 ≤ m < 2

dim

, is linked to vertices ((l − 1) mod dim, m),

((l + 1) mod dim, m), and (l, m ⊕ 2

l

), and is labeled l × 2

dim

+ m. ⊕ denotes

the bitwise exclusive-or binary operator, and a mod b the integer remainder
of the euclidian division of a by b.

Program amk fft2 outputs the target architecture file of a binary Fast-
Fourier-Transform graph of dimension dim.

Vertex (l, m) of FFT(dim),

with 0 ≤ l ≤ dim and 0 ≤ m < 2

dim

, is linked to vertices (l − 1, m),

(l − 1, m mod 2

l−1

), (l + 1, m), and (l + 1, m ⊕ 2

l

), if they exist, and is labeled

l

× 2

dim

+ m.

30

Advertising