activity
20072017
most citedComparison of different Propagation Steps for the Lattice Boltzmann Method

102 citations · 207 across the 12 of their papers we have counts for

collaborators
Showing cs.DCShow all

9 papers · 1 filter

cs.DC2017

CRAFT: A library for easier application-level Checkpoint/Restart and Automatic Fault Tolerance

Faisal Shahzad, Jonas Thies, Moritz Kreutzer +3

In order to efficiently use the future generations of supercomputers, fault tolerance and power consumption are two of the prime challenges anticipated by the High Performance Comp…

cs.DC2016★ 1 cited

Extreme Scale-out SuperMUC Phase 2 - lessons learned

Nicolay Hammer, Ferdinand Jamitzky, Helmut Satzger +36

In spring 2015, the Leibniz Supercomputing Centre (Leibniz-Rechenzentrum, LRZ), installed their new Peta-Scale System SuperMUC Phase2. Selected users were invited for a 28 day extr…

cs.DC2015★ 1 cited

Building a fault tolerant application using the GASPI communication layer

Faisal Shahzad, Moritz Kreutzer, Thomas Zeiser +4

It is commonly agreed that highly parallel software on Exascale computers will suffer from many more runtime failures due to the decreasing trend in the mean time to failures (MTTF…

cs.DC2014★ 7 cited

Modeling and analyzing performance for highly optimized propagation steps of the lattice Boltzmann method on sparse lattices

M. Wittmann, T. Zeiser, G. Hager +1

Computational fluid dynamics (CFD) requires a vast amount of compute cycles on contemporary large-scale parallel computers. Hence, performance optimization is a pivotal activity in…

cs.DC2013★ 22 cited

Asynchronous MPI for the Masses

Markus Wittmann, Georg Hager, Thomas Zeiser +1

We present a simple library which equips MPI implementations with truly asynchronous non-blocking point-to-point operations, and which is independent of the underlying communicatio…

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…