1MPMETIS(1) User Commands MPMETIS(1)
2
3
4
6 mpmetis - Partitions a mesh into a specified number of parts.
7
9 mpmetis [options] meshfile nparts
10
12 Required parameters
13
14 meshfile
15 Stores the mesh to be partitioned.
16
17 nparts The number of partitions to split the mesh.
18
19 Optional parameters
20
21 -gtype=string
22
23 Specifies the graph to be used for computing the partitioning
24 The possible values are:
25
26 dual - Partition the dual graph of the mesh [default]
27
28 nodal - Partition the nodal graph of the mesh
29
30 -ptype=string
31
32 Specifies the scheme to be used for computing the k-way parti‐
33 tioning. The possible values are:
34
35 rb - Recursive bisectioning
36
37 kway - Direct k-way partitioning [default]
38
39 -ctype=string
40
41 Specifies the scheme to be used to match the vertices of the
42 graph during the coarsening. The possible values are:
43
44 rm - Random matching
45
46 shem - Sorted heavy-edge matching [default]
47
48 -iptype=string [applies only when -ptype=rb]
49
50 Specifies the scheme to be used to compute the initial parti‐
51 tioning of the graph. The possible values are:
52
53 grow - Grow a bisection using a greedy strategy [default]
54
55 random - Compute a bisection at random
56
57 -objtype=string [applies only when -ptype=kway]
58
59 Specifies the objective that the partitioning routines will
60 optimize. The possible values are:
61
62 cut - Minimize the edgecut [default]
63
64 vol - Minimize the total communication volume
65
66 -contig [applies only when -ptype=kway]
67
68 Specifies that the partitioning routines should try to produce
69 partitions that are contiguous. Note that if the input graph is
70 not connected this option is ignored.
71
72 -minconn [applies only when -ptype=kway]
73
74 Specifies that the partitioning routines should try to minimize
75 the maximum degree of the subdomain graph, i.e., the graph in
76 which each partition is a node, and edges connect subdomains
77 with a shared interface.
78
79 -tpwgts=filename
80
81 Specifies the name of the file that stores the target weights
82 for each partition. By default, all partitions are assumed to be
83 of the same size.
84
85 -ufactor=int
86
87 Specifies the maximum allowed load imbalance among the parti‐
88 tions. A value of x indicates that the allowed load imbalance
89 is 1+x/1000. For ptype=rb, the load imbalance is measured as
90 the ratio of the 2*max(left,right)/(left+right), where left and
91 right are the sizes of the respective partitions at each bisec‐
92 tion. For ptype=kway, the load imbalance is measured as the
93 ratio of max_i(pwgts[i])/avgpwgt, where pwgts[i] is the weight
94 of the ith partition and avgpwgt is the sum of the total vertex
95 weights divided by the number of partitions requested. For
96 ptype=rb, the default value is 1 (i.e., load imbalance of
97 1.001). For ptype=kway, the default value is 30 (i.e., load
98 imbalance of 1.03).
99
100 -ncommon=int
101
102 Specifies the common number of nodes that two elements must have
103 in order to put an edge between them in the dual graph. Default
104 is 1.
105
106 -niter=int
107
108 Specifies the number of iterations for the refinement algorithms
109 at each stage of the uncoarsening process. Default is 10.
110
111 -ncuts=int
112
113 Specifies the number of different partitionings that it will
114 compute. The final partitioning is the one that achieves the
115 best edgecut or communication volume. Default is 1.
116
117 -nooutput
118
119 Specifies that no partitioning file should be generated.
120
121 -seed=int
122
123 Selects the seed of the random number generator.
124
125 -dbglvl=int
126
127 Selects the dbglvl.
128
129 -help
130
131 Prints this message.
132
133
134
135mpmetis 5.1.0 January 2020 MPMETIS(1)