• Corpus ID: 7458399

A Software Package for Partitioning Unstructured Graphs , Partitioning Meshes , and Computing Fill-Reducing Orderings of Sparse Matrices Version 5 . 0

@inproceedings{Karypis1998ASP,
  title={A Software Package for Partitioning Unstructured Graphs , Partitioning Meshes , and Computing Fill-Reducing Orderings of Sparse Matrices Version 5 . 0},
  author={George Karypis},
  year={1998}
}
∗METIS is copyrighted by the regents of the University of Minnesota . This work was supported by IST/BMDO through Army Research O ffice contract DA/DAAH04-93-G-0080, and by Army High Performanc e Computing Research Center under the auspices of the Depart ment of the Army, Army Research Laboratory cooperative agreement number DAA H04-95-2-0003/contract number DAAH04-95-C-0008, the con tent of which does not necessarily reflect the position or the policy of the gove rnment, and no official… 

Figures and Tables from this paper

International Workshop on Parallel Matrix Algorithms and Applications Parallel Restricted Maximum Likelihood Estimation for Linear Models with a Dense Exogenous Matrix. Iterative Methods Least-squares Polynomial Preconditioners for Symmetric Indefinite Linear Parallel Computation of Generalized Eige

This tutorial provides an overview of the recent developments and state of the art in the areas of high performance hardware, tools and environments, and libraries as related to the matrix algorithms and some aspects of iterative and direct methods for the (partial) eigensolution of real symmetric matrices are addressed.

Research Reports on Mathematical and Computing Sciences Department of Mathematical and Computing Sciences Tokyo Institute of Technology SERIES B : Operations Research

The SDPA-C (SemiDefinite Programming Algorithm – Completion method) is a software package designed for solving large scale sparse SDPs (semidefinite programming problems) using the positive definite matrix completion theory.

Algebraic Distance on Graphs | SIAM Journal on Scientific Computing | Vol. 33, No. 6 | Society for Industrial and Applied Mathematics

This paper considers an iterative process that smooths an associated value for nearby vertices, and presents a measure of the local connection strength, called the algebraic distance, which is attractive in that the process is simple, linear, and easily parallelized.

Shape optimizing load balancing for MPI-parallel adaptive numerical simulations

This work explores the promising diffusion-based multilevel graph partitioning algorithm DibaP, and describes the evolution of the algorithm and reports on its MPI implementation PDibaP for parallelism with distributed memory.

PMORSy: parallel sparse matrix ordering software for fill-in minimization†

The NP-complete fill-in minimization problem is solved by means of multilevel nested dissection algorithm with modifications for vertex separators and parallel processing is done in a task-based fashion with the granularity tuning.

Multilevel Hypergraph Partitioning with Vertex Weights Revisited

This work develops an approach based on an assignment of heavy vertices as fixed vertices to both blocks of the bisection (which it is called a prepacking) and uses theoretical results to prove that the balance of the final partition can be guaranteed.

Parallel Computing Techniques for Large-Scale Reservoir Simulation of Multi- Component and Multiphase Fluid Flow

The results indicate that the parallel code TOUGH2 is significantly improve c apacity and efficiency for large-scale simulations, and the METIS software package for partitioning unstructured graph and meshes is adopted for domain partitioning.

An improved recursive graph bipartitioning algorithm for well balanced domain decomposition

This paper revisit the original algorithm introduced by Lipton, Rose and Tarjan in 1979 which performed the recursion for nested dissection in a particular manner and proposes several variations of the existing algorithms in the multilevel Scotch partitioner that take into account multiple criteria.

Optimized Schwarz and 2-Lagrange Multiplier Methods for Multiscale Elliptic PDEs

This article formulate and analyze a two-level preconditioner for optimized Schwarz and 2-Lagrange multiplier methods for PDEs with highly heterogeneous (multiscale) diffusion coefficients and shows that the GMRES algorithm applied to the heterogeneous system converges in O(1/\epsilon) iterations.

TOUGH 2 _ MP : A PARALLEL VERSION OF TOUGH 2

The development of the TOUGH2_MP is reviewed, the basic features, modules, and their applications are discussed, and the standard message-passing interface is adopted for communication among processors.
...

References

SHOWING 1-10 OF 15 REFERENCES

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.

Multilevel Algorithms for Multi-Constraint Graph Partitioning

This work focuses on developing new types of heuristics for coarsening, initial partitioning, and refinement that are capable of successfully handling multiple constraints that underlay many existing and emerging large-scale scientific simulations.

Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems

A multilevel version of RSB is introduced that attains about an order-of-magnitude improvement in run time on typical examples of unstructured meshes used in several large-scale scientific and engineering problems.

Multilevel k-way Partitioning Scheme for Irregular Graphs

In this paper, we present and study a class of graph partitioning algorithms that reduces the size of the graph by collapsing vertices and edges, we find ak-way partitioning of the smaller graph, and

A multilevel algorithm for partitioning graphs

A multilevel algorithm for graph partitioning in which the graph is approximated by a sequence of increasingly smaller graphs, and the smallest graph is then partitioned using a spectral method, and this partition is propagated back through the hierarchy of graphs.

The Chaco user`s guide. Version 1.0

The Chaco software package allows for recursive application of any of several different methods for finding small edge separators in weighted graphs, including inertial, spectral, Kernighan-Lin and multilevel methods in addition to several simpler strategies.

Multilevel hypergraph partitioning: application in VLSI domain

The experiments show that the multilevel hypergraph partitioning algorithm produces high quality partitioning in relatively small amount of time and outperforms other schemes (in hyperedge cut) quite consistently with larger margins.

Highly Scalable Parallel Algorithms for Sparse Matrix Factorization

The first algorithms to factor a wide class of sparse matrices that are asymptotically as scalable as dense matrix factorization algorithms on a variety of parallel architectures are presented.

An efficient heuristic procedure for partitioning graphs

A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.

Introduction to parallel computing: design and analysis of algorithms

Performance and Scalability of Parallel Systems, General Issues in Mapping Systolic Systems Onto Parallel Computers, and Speedup Anomalies in Parallel Search Algorithms.