Scotch Brand 5.1.10 - Manual (Page 25)

mesh2D dimX dimY
Defines a bidimensional array of dimX columns by dimY rows. The vertex
with coordinates (posX, posY) has label posY × dimX + posX.
mesh3D dimX dimY dimZ
Defines a tridimensional array of dimX columns by dimY rows by dimZ lev-
els. The vertex with coordinates (posX,posY,posZ ) has label (posZ × dimY +
posY
) × dimX + posX.
torus2D dimX dimY
Defines a bidimensional array of dimX columns by dimY rows, with
wraparound edges.
The vertex with coordinates (posX, posY) has label
posY × dimX + posX.
torus3D dimX dimY dimZ
Defines a tridimensional array of dimX columns by dimY rows by dimZ levels,
with wraparound edges. The vertex with coordinates (posX,posY,posZ ) has
label (posZ × dimY + posY) × dimX + posX.
5.4.3 Variable-sized architecture files
Variable-sized architectures are a class of algorithmically-coded architectures the
size of which is not defined a priori. As for fixed-size algorithmically-coded ar-
chitectures, they start with an abbreviation name of the architecture, followed by
parameters specific to the architecture. The available built-in variable-sized archi-
tecture definitions are listed below.
varcmplt
Defines a variable-sized complete graph. Domains are labeled such that the
first domain is labeled 1, and the two subdomains of any domain i are labeled
2i and 2i + 1. The distance between any two subdomains i and j is 0 if i = j
and 1 else.
varhcub
Defines a variable-sized hypercube. Domains are labeled such that the first
domain is labeled 1, and the two subdomains of any domain i are labeled 2i
and 2i + 1. The distance between any two domains is the Hamming distance
between the common bits of the two domains, plus half of the absolute dif-
ference between the levels of the two domains, this latter term modeling the
average distance on unknown bits. For instance, the distance between subdo-
main 9 = 1001
B
, of level 3 (since its leftmost 1 has been shifted left thrice),
and subdomain 53 = 110101
B
, of level 5 (since its leftmost 1 has been shifted
left five times), is 2: it is 1, which is the number of bits which differ between
1101
B
(that is, 53 = 110101
B
shifted rightwards twice) and 1001
B
, plus 1,
which is half of the absolute difference between 5 and 3.
5.5 Mapping files
Mapping files, which usually end in “.map”, contain the result of the mapping of
source graphs onto target architectures. They associate a vertex of the target graph
with every vertex of the source graph.
Mapping files begin with the number of mapping lines which they contain, fol-
lowed by that many mapping lines. Each mapping line holds a mapping pair, made
of two integer numbers which are the label of a source graph vertex and the label
25