METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering
History of Changes
| Ver: 5.0pre2, April 8th, 2007 |
|---|
- Fixed a number of bugs with the 64bit support and added some basic build instructions.
The new code has been reasonably well-tested under Linux and GCC. However, more testing is needed on different architectures.
- Portable I/O on both 32- and 64-bit architectures.
- There were a few major reorganization in the internals of the code. It now utilizes a home-grown library of helper routines. This will enable the library on fatal errors to release the memory to the application and gracefully return to the calling program. This will probably be enabled in the near future.
- A compiler that supports C99 is now required.
|
| Ver: 5.0pre1, March 2007 |
|---|
- Initial support for 64 bit architectures (see include/metis.h)
- Fixed some bugs that appeared over the years (still work in progress)
- Unified unix/windows build (requires Gnu's make on windows)
|
| Ver: 4.0.1, November 1998 |
|---|
- Fixed some bugs with the multi-constraint partitioning routines.
- Fixed some bugs with the partitioning routines that directly minimize the total communication volume.
|
| Ver: 4.0.0, September 1998 |
|---|
- Added partitioning routines that can compute a k-way partitioning in the presence of multiple balancing constraints.
- Added partitioning routines whose objective is to directly minimize the total communication volume of the partitioning.
- Added routines that directly minimize the maximum and the overall connectivity of the subdomains.
- Added routines that reduce the number of non-contiguous subdomains.
|
| Ver: 3.0.6, January 1998 |
|---|
- 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
|
| Ver: 3.0.5, December 1997 |
|---|
- Fixed problems on 64-bit architectures (e.g., -64 option on SGIs)
- Added some options in Makefile.in
|
| Ver: 3.0.4, December 1997 |
|---|
- Fixed a memory leak in the ordering code
|
| Ver: 3.0.3, December 1997 |
|---|
- 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
- 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 node-refinement code
|
| Ver: 3.0.0, October 1997 |
|---|
- Added partitioning routines that can be used to compute a partition with prescribed partition weights. For example, they can be used to compute a 3-way 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.
- Improved the speed of the k-way partitioning algorithm. 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 in 256 parts, a 4 million node graph in well under a minute on a MIPS R10000.
- 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, tetrahedral, hexahedral, quadrilaterals.
- 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.
- Added a node based ordering code that greatly improves ordering quality.
- Improved the quality of the orderings produced by the original edge-based ordering code.
- METIS can now analyze the graph and try to compress together nodes with identical sparsity pattern. For some problems, this significantly reduces ordering time.
- Added better support for ordering LP matrices.
- The names, calling sequences, and options of the routines in METISlib have been changed.
- Better support has been added for Fortran programs.
- Better support for weighted graphs.
|
|
|