1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149

METIS 4.0.1, 11/29/98

This is mostly a bugfix release
 Fixed some bugs in the multiconstraint partitioning routines
 Fixed some bugs in the volumeminimization routines
METIS 4.0.0, 9/20/98

METIS 4.0 contains a number of changes over the previous major release (ver
3.0.x). Most of these changes are concentrated on the graph and mesh
partitioning routines and they do not affect the sparse matrix reordering
routines. Here is a list of the major changes:
MultiConstraint Partitioning

METIS now includes partitioning routines that can be used to a partition
a graph in the presence of multiple balancing constraints.
Minimizing the Total Communication Volume

METIS now includes partitioning routines whose objective is to minimize
the total communication volume (as opposed to minimizing the edgecut).
Minimizing the Maximum Connectivity of the Subdomains

The kway partitioning routines in METIS can now directly minimize the number
of adjacent subdomains. For most graphs corresponding to finite element
meshes, METIS is able to significantly reduce the maximum (and total) number of
adjacent subdomains.
METIS 3.0.6, 1/28/98

 Fixed some problems when too many partitions were asked, and each partition
end up having 0 vertices
 Fixed some bugs in the I/O routines
 Added support for the g77 compiler under Linux
METIS 3.0.5, 12/22/97

 Fixed problems on 64bit architectures (eg., 64 option on SGIs).
 Added some options in Makefile.in
METIS 3.0.4, 12/1/97

Fixed a memory leak in the ordering code.
METIS 3.0.3, 11/5/97

This is mostly a bugfix release with just a few additions
Added functionality
 Added support for quadrilateral elements.
 Added a routine METIS_EstimateMemory that estimates the amount of
memory that will be allocated by METIS. This is useful in determining
if a problem can run on your system.
 Added hooks to allow PARMETIS to use the orderings produced by METIS.
This is hidden from the user but it will be used in the next release
of PARMETIS.
Bugfixes
 Fixed a bug related to memory allocation. This should somewhat reduce the
overall memory used by METIS.
 Fixed some bugs in the 'graphchk' program in the case of weighted graphs.
 Removed some code corresponding to unused options.
 Fixed some minor bugs in the noderefinement code

METIS 3.0 contains a number of changes over METIS 2.0.
The major changes are the following:
General Changes

1. Added code to directly partition finite element meshes.
2. Added code to convert finite element meshes into graphs so they
can be used by METIS.
1. The names, calling sequences, and options of the routines in
METISlib have been changed.
2. Better support has been added for Fortran programs.
3. Eliminated the 'metis' program. The only way to tune METIS's
behavior is to use METISlib.
4. Improved memory management. METIS should now only abort if truly
there is no more memory left in the system.
Graph Partitioning

1. Added partitioning routines that can be used to compute a partition
with prescribed partition weights. For example, they can be used to
compute a 3way partition such that partition 1 has 50% of the weight,
partition 2 has 20% of the way, and partition 3 has 30% of the weight.
2. Improved the speed of the kway partitioning algorithm (kmetis). The
new code has better cache locality which dramatically improves the
speed for large graphs. A factor of 4 speedup can be obtained for
certain graphs. METIS can now partition a 4 million node graph
in well under a minute on a MIPS R10000.
3. Eliminated some of the options that were seldom used.
FillReducing Orderings

1. Added a node based ordering code `onmetis' that greatly improves
ordering quality.
2. Improved the quality of the orderings produced by the original
edgebased ordering code (it is now called 'oemetis').
3. METIS can now analyze the graph and try to compress together
nodes with identical sparsity pattern. For some problems, this
significantly reduces ordering time
4. METIS can now prune dense columns prior to ordering. This can be
helpful for LP matrices.
Mesh Partitioning

1. METIS can now directly partition the element node array of finite
element meshes. It produces two partitioning vectors. One for the
elements and one for the nodes. METIS supports the following
elements: triangles, tetrahedra, hexahedra
MeshToGraph Conversion Routines

1. METIS now includes a number of mesh conversion functions that can
be used to create the dual and nodal graphs directly from the
element connectivity arrays. These are highly optimized routines.
