activity
19952026
most citedThe Kernel Polynomial Method

1.1k citations · 4.5k across the 114 of their papers we have counts for

collaborators
Showing 2011 · cs.DCShow all

5 papers · 2 filters

cs.DC2011★ 34 cited

Sparse matrix-vector multiplication on GPGPU clusters: A new storage format and a scalable implementation

Moritz Kreutzer, Georg Hager, Gerhard Wellein +3

Sparse matrix-vector multiplication (spMVM) is the dominant operation in many sparse solvers. We investigate performance properties of spMVM with matrices of various sparsity patte…

cs.DC2011★ 9 cited

Domain decomposition and locality optimization for large-scale lattice Boltzmann simulations

Markus Wittmann, Thomas Zeiser, Georg Hager +1

We present a simple, parallel and distributed algorithm for setting up and partitioning a sparse representation of a regular discretized simulation domain. This method is scalable…

cs.DC2011★ 102 cited

Comparison of different Propagation Steps for the Lattice Boltzmann Method

Markus Wittmann, Thomas Zeiser, Georg Hager +1

Several possibilities exist to implement the propagation step of the lattice Boltzmann method. This paper describes common implementations which are compared according to the numbe…

cs.DC2011★ 30 cited

Hybrid-parallel sparse matrix-vector multiplication with explicit communication overlap on current multicore-based systems

Gerald Schubert, Holger Fehske, Georg Hager +1

We evaluate optimized parallel sparse matrix-vector operations for several representative application areas on widespread multicore-based cluster configurations. First the single-s…

cs.DC2011★ 518 cited

LIKWID: Lightweight Performance Tools

Jan Treibig, Georg Hager, Gerhard Wellein

Exploiting the performance of today's microprocessors requires intimate knowledge of the microarchitecture as well as an awareness of the ever-growing complexity in thread and cach…