The Zoltan and Isorropia parallel toolkits for combinatorial scientific computing: Partitioning, ordering and coloring
Reads0
Chats0
TLDR
This paper developed Isorropia as a Trilinos package, which supports most of Zoltan's features via a matrix-based interface, and serves as a platform for additional matrix algorithms.Abstract:
Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs. The Zoltan toolkit was developed primarily for partitioning and load balancing to support dynamic parallel applications, but has expanded to support other problems in combinatorial scientific computing, including matrix ordering and graph coloring. Zoltan is based on abstract user interfaces and uses callback functions. To simplify the use and integration of Zoltan with other matrix-based frameworks, such as the ones in Trilinos, we developed Isorropia as a Trilinos package, which supports most of Zoltan's features via a matrix-based interface. In addition to providing an easy-to-use matrix-based interface to Zoltan, Isorropia also serves as a platform for additional matrix algorithms. In this paper, we give an overview of the Zoltan and Isorropia toolkits, their design, capabilities and use. We also show how Zoltan and Isorropia enable large-scale, parallel scientific simulations, and describe current and future development in the next-generation package Zoltan2.read more
Citations
More filters
Journal ArticleDOI
A survey of direct methods for sparse linear systems
TL;DR: The goal of this survey article is to impart a working knowledge of the underlying theory and practice of sparse direct methods for solving linear systems and least-squares problems, and to provide an overview of the algorithms, data structures, and software available to solve these problems.
Journal ArticleDOI
MFEM: a modular finite element methods library
R W Anderson,Julian Andrej,Andrew T. Barker,Jamie A. Bramwell,Jean-Sylvain Camier,Jakub Cerveny,Veselin Dobrev,Yohann Dudouit,Aaron Fisher,Tzanio V. Kolev,Will Pazner,M L Stowell,Vladimir Tomov,Ido Akkerman,Johann Dahm,David Medina,Stefano Zampini +16 more
TL;DR: MFEM as mentioned in this paper is an open-source, lightweight, flexible and scalable C++ library for modular finite element methods that features arbitrary high-order finite element meshes and spaces, support for a wide variety of discretization approaches and emphasis on usability, portability, and highperformance computing efficiency.
Proceedings ArticleDOI
Scalable matrix computations on large scale-free graphs using 2D graph partitioning
TL;DR: This work proposes a new two-dimensional partitioning algorithm that combines graph partitioning with 2D block distribution and demonstrates that this new 2D partitioning method consistently outperforms the other methods considered, for both SpMV and an eigensolver, on matrices with up to 1.6 billion nonzeros.
Journal ArticleDOI
Vlasov methods in space physics and astrophysics
Minna Palmroth,Minna Palmroth,Urs Ganse,Yann Pfau-Kempf,Markus Battarbee,Lucile Turc,Thiago Brito,Maxime Grandin,Sanni Hoilijoki,A. Sandroos,Sebastian von Alfthan +10 more
TL;DR: The Vlasov system is presented and an example implementation is introduced to illustrate that even with massive computational challenges, an accurate description of physics can be rewarding in itself and significantly advance the authors' understanding.
Journal ArticleDOI
Hybrid parallelization of the LIGGGHTS open-source DEM code
TL;DR: The problems encountered and the solutions implemented to achieve scalable performance using both MPI/OpenMP hybrid parallelization of the LIGGGHTS open-source software package for Discrete Element Methods (DEM) are outlined.
References
More filters
Journal ArticleDOI
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
George Karypis,Vipin Kumar +1 more
TL;DR: 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.
MPI: A Message-Passing Interface Standard
TL;DR: This document contains all the technical features proposed for the interface and the goal of the Message Passing Interface, simply stated, is to develop a widely used standard for writing message-passing programs.
Journal ArticleDOI
Some simplified NP-complete graph problems
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.
Proceedings ArticleDOI
Reducing the bandwidth of sparse symmetric matrices
E. Cuthill,J. McKee +1 more
TL;DR: A direct method of obtaining an automatic nodal numbering scheme to ensure that the corresponding coefficient matrix will have a narrow bandwidth is presented.
Proceedings ArticleDOI
A Multi-Level Algorithm For Partitioning Graphs
TL;DR: 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.
Related Papers (5)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
George Karypis,Vipin Kumar +1 more
An overview of the Trilinos project
PETSc Users Manual
Satish Balay,Shrirang Abhyankar,Mark F. Adams,Jed Brown,Peter R. Brune,Kristopher R. Buschelman,Lisandro Dalcin,Alp Dener,Eijkhout,William Gropp,Dmitry Karpeyev,Dinesh K. Kaushik,Matthew G. Knepley,Dave A. May,L. Curfman McInnes,Richard T. Mills,Todd Munson,Karl Rupp,Patrick Sanan,Barry Smith,Stefano Zampini,Hong Zhang +21 more