Learn More
We investigate the problem of symmetrically permuting a square sparse matrix into a block diagonal form with overlap. This permutation problem arises in the parallelization of an explicit formulation of the multiplicative Schwarz preconditioner and a more recent block overlapping banded linear solver as well as its application to general sparse linear(More)
In this whitepaper, we describe the problem of permuting sparse square matrices into block diagonal form with overlap (BDO) and propose a graph partitioning algorithm for solving this problem. A block diagonal matrix with overlap is a block diagonal matrix whose consecutive diagonal blocks may overlap. The objective in this permutation problem is to(More)
Intelligent partitioning models are commonly used for efficient parallelization of irregular applications on distributed systems. These models usually aim to minimize a single communication cost metric, which is either related to communication volume or message count. However, both volume- and message-related metrics should be taken into account during(More)
  • 1