As modern supercomputers approach the Exascale, many numerical libraries face scalability issues due to the massive increase in CPU cores compared to memory bandwidth. Sparse matrix algorithms, e.g. iterative linear and eigenvalue solvers, are particularly affected by the relatively slow memory subsystem. In the German Research Foundation (DFG) project ESSEX (Equipping Sparse Solvers for Exascale), we developed the flexible software framework PHIST for implementing iterative methods on HPC systems. PHIST (Pipelined Hybrid Iterative Solver Toolkit) has been developed containing an interface to the existing numerical software framework Trilinos originally. PHIST also includes adapters to basic building block libraries so that high-level a...
This paper describes two portable packages for general-purpose sparse matrix computations: SPARSKIT...
Iterative solvers for eigenvalue problems are often the only means of computing the extremal eigenva...
revision 2001/06/01 We present a benchmark of iterative solvers for sparse matrices. The benchmark c...
The increasing complexity of hardware and software environments in high-performance computing poses ...
<p>Presented at SIAM CSE17 Minisymposium: Software Productivity and Sustainability for CSE and Data ...
In the German Research Foundation project ESSEX (Equipping Sparse Solvers for Exascale), we develop ...
The ESSEX project is funded by the German DFG priority programme 1648 Software for Exascale Computin...
The complexity of the latest HPC architectures increasingly limits the productivity of researchers i...
As we approach the Exascale computing era, disruptive changes in the software landscape are required...
Mathematicians and domain scientists who want to implement their algorithms on a supercomputer typic...
Solving large-scale systems of linear equations [] { } {}bxA = is one of the most expensive and cr...
We present a benchmark of iterative solvers for sparse matrices. The benchmark contains several comm...
In the German Research Foundation (DFG) project ESSEX (Equipping Sparse Solvers for Exascale), we de...
This paper presents a new software framework for solving large and sparse linear systems on current ...
Themes and Motivation The innermost computational kernel of many large-scale scientific applicati...
This paper describes two portable packages for general-purpose sparse matrix computations: SPARSKIT...
Iterative solvers for eigenvalue problems are often the only means of computing the extremal eigenva...
revision 2001/06/01 We present a benchmark of iterative solvers for sparse matrices. The benchmark c...
The increasing complexity of hardware and software environments in high-performance computing poses ...
<p>Presented at SIAM CSE17 Minisymposium: Software Productivity and Sustainability for CSE and Data ...
In the German Research Foundation project ESSEX (Equipping Sparse Solvers for Exascale), we develop ...
The ESSEX project is funded by the German DFG priority programme 1648 Software for Exascale Computin...
The complexity of the latest HPC architectures increasingly limits the productivity of researchers i...
As we approach the Exascale computing era, disruptive changes in the software landscape are required...
Mathematicians and domain scientists who want to implement their algorithms on a supercomputer typic...
Solving large-scale systems of linear equations [] { } {}bxA = is one of the most expensive and cr...
We present a benchmark of iterative solvers for sparse matrices. The benchmark contains several comm...
In the German Research Foundation (DFG) project ESSEX (Equipping Sparse Solvers for Exascale), we de...
This paper presents a new software framework for solving large and sparse linear systems on current ...
Themes and Motivation The innermost computational kernel of many large-scale scientific applicati...
This paper describes two portable packages for general-purpose sparse matrix computations: SPARSKIT...
Iterative solvers for eigenvalue problems are often the only means of computing the extremal eigenva...
revision 2001/06/01 We present a benchmark of iterative solvers for sparse matrices. The benchmark c...