Download downloading
Transcript
Stockmeyer algorithm, the greedy graph growing heuristic, and a greedy “exactifying” refinement algorithm designed to balance vertex loads as much as possible; random and backtracking methods are also provided. The -m option allows the user to define the mapping strategy. If mapping statistics are wanted rather than the mapping output itself, mapping output can be set to /dev/null, with option -vmt to get mapping statistics and timings. Options Since the program is devoted to experimental studies, it has many optional parameters, used to test various execution modes. Values set by default will give best results in most cases. -h Display the program synopsis. -mstrat Apply mapping strategy strat. The format of mapping strategies is defined in section 7.3.1. -sobj Mask source edge and vertex weights. This option allows the user to “unweight” weighted source graphs by removing weights from edges and vertices at loading time. obj may contain several of the following switches. e v -V Remove edge weights, if any. Remove vertex weights, if any. Print the program version and copyright. -vverb Set verbose mode to verb, which may contain several of the following switches. For a detailed description of the data displayed, please refer to the manual page of gmtst below. m s t -V 6.3.7 Mapping information. Strategy information. This parameter displays the default mapping strategy used by gmap. Timing information. Print the program version and copyright. gmk * Synopsis gmk hy dim [output graph file] options gmk m2 dimX [dimY [output graph file]] options gmk m3 dimX [dimY [dimZ [output graph file]]] options gmk ub2 dim [output graph file] options Description The gmk * programs make source graphs. Each of them is devoted to a specific topology, for which it builds target graphs of any dimension. 34