-h
Display the program synopsis.
-V
Print the program version and copyright.
6.3.9
gmtst
Synopsis
gmtst
[
input graph file
[
input target file
[
input mapping file
[
output data
file
]]]]
options
Description
The program
gmtst
is the graph mapping tester. It outputs some statistics
on the given mapping, regarding load balance and inter-processor communi-
cation.
The two first statistics lines deal with process mapping statistics, while the
following ones deal with communication statistics. The first mapping line
gives the number of processors used by the mapping, followed by the number
of processors available in the architecture, and the ratio of these two numbers,
written between parentheses. The second mapping line gives the minimum,
maximum, and average loads of the processors, followed by the variance of the
load distribution, and an imbalance ratio equal to the maximum load over the
average load. The first communication line gives the minimum and maximum
number of neighbors over all blocks of the mapping, followed by the sum of the
number of neighbors over all blocks of the mapping, that is the total number
of messages that have to be sent to exchange data between all neighboring
blocks. The second communication line gives the average dilation of the edges,
followed by the sum of all edge dilations. The third communication line gives
the average expansion of the edges, followed by the value of function
f
C
. The
fourth communication line gives the average cut of the edges, followed by the
number of cut edges. The fifth communication line shows the ratio of the aver-
age expansion over the average dilation; it is smaller than 1 when the mapper
succeeds in putting heavily intercommunicating processes closer to each other
than it does for lightly communicating processes; it is equal to 1 if all edges
have the same weight. The remaining lines form a distance histogram, which
shows the amount of communication load that involves processors located at
increasing distances.
gmtst
allows the testing of cross-architecture mappings. By inputing it a
target architecture different from the one that has been used to compute the
mapping, but with compatible vertex labels, one can see what the mapping
would yield on this new target architecture.
Options
-h
Display the program synopsis.
-V
Print the program version and copyright.
6.3.10
gord
Synopsis
gord
[
input graph file
[
output ordering file
[
output log file
]]]
options
37
