A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
The interface probing technique in domain decomposition
SIAM Journal on Matrix Analysis and Applications
A parallel hashed Oct-Tree N-body algorithm
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Scalable iterative solution of sparse linear systems
Parallel Computing
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
ILUM: a multi-elimination ILU preconditioner for general sparse matrices
SIAM Journal on Scientific Computing
Multilevel diffusion schemes for repartitioning of adaptive meshes
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Zoltan Data Management Service for Parallel Dynamic Applications
Computing in Science and Engineering
A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices
PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Combinatorial algorithms in scientific computing
Combinatorial algorithms in scientific computing
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
SIAM Journal on Scientific Computing
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
PyTrilinos: High-performance distributed-memory solvers for Python
ACM Transactions on Mathematical Software (TOMS)
On the design of interfaces to sparse direct solvers
ACM Transactions on Mathematical Software (TOMS)
A framework for scalable greedy coloring on distributed-memory parallel computers
Journal of Parallel and Distributed Computing
PT-Scotch: A tool for efficient parallel graph ordering
Parallel Computing
A repartitioning hypergraph model for dynamic load balancing
Journal of Parallel and Distributed Computing
hwloc: A Generic Framework for Managing Hardware Affinities in HPC Applications
PDP '10 Proceedings of the 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
SIAM Journal on Scientific Computing
Parallel hypergraph partitioning for scientific computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
SIAM Journal on Scientific Computing
Distributed-Memory Parallel Algorithms for Matching and Coloring
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
SIAM Journal on Scientific Computing
Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
SIAM Journal on Scientific Computing
Combining performance aspects of irregular gauss-seidel via sparse tiling
LCPC'02 Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing
Improving graph coloring on distributed-memory parallel computers
HIPC '11 Proceedings of the 2011 18th International Conference on High Performance Computing
ShyLU: A Hybrid-Hybrid Solver for Multicore Platforms
IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium
Hi-index | 0.00 |
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.