Achim Basermann

Achim Basermann

Auto-generated profile, based on publicly available information

Achim Basermann

German Aerospace Center, Institute of Software Technology, Oberpfaffenhofen/Cologne, Germany

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2021 in Mathematical Biosciences
Verified
Journal Article
Closed access
MKMartin J. Kühn
Martin J. Kühn
DADaniel Abele
Daniel Abele
TMTanmay Mitra
Tanmay Mitra
WKWadim Koslow
Wadim Koslow
MAMajid Abedi
Majid Abedi
MMMichael Meyer-Hermann
Michael Meyer-Hermann

1 May 2012
Verified
Conference Paper
Closed access
MKMoritz Kreutzer
Moritz Kreutzer
GHGeorg Hager
Georg Hager
GWGerhard Wellein
Gerhard Wellein
HFHolger Fehske
Holger Fehske
ABAchim Basermann
Achim Basermann
ABAlan R. Bishop
Alan R. Bishop
Sparse matrix-vector multiplication (spMVM) is the dominant operation in many sparse solvers. We investigate performance properties of spMVM with matrices of various sparsity patterns on the nVidia "Fermi" class of GPGPUs. A new "padded jagged diagonals storage" (pJDS) format is proposed which may substantially reduce the memory overhead intrinsic to the widespread ELLPACK-R scheme while making no assumptions about the matrix structure. In our test scenarios the pJDS format cuts the overall spMVM memory footprint on the GPGPU by up to 70%, and achieves 91% to 130% of the ELLPACK-R performance. Using a suitable performance model we identify performance bottlenecks on the node level that invalidate some types of matrix structures for efficient multi-GPGPU parallelization. For appropriate sparsity patterns we extend previous work on distributed-memory parallel spMVM to demonstrate a scalable hybrid MPI-GPGPU code, achieving efficient overlap of communication and computation.

1 October 2016 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
MKMoritz Kreutzer
Moritz Kreutzer
JTJonas Thies
Jonas Thies
MRMelven Röhrig-Zöllner
Melven Röhrig-Zöllner
APAndreas Pieper
Andreas Pieper
FSFaisal Shahzad
Faisal Shahzad
GWGerhard Wellein
Gerhard Wellein

16 May 2022 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
WKWadim Koslow
Wadim Koslow
MKMartin J. Kühn
Martin J. Kühn
SBSebastian Binder
Sebastian Binder
MKMargrit Klitz
Margrit Klitz
DADaniel Abele
Daniel Abele
MMMichael Meyer-Hermann
Michael Meyer-Hermann
We analyze the relaxation of non-pharmaceutical interventions (NPIs) under an increasing number of vaccinations in Germany. For the spread of SARS-CoV-2 we employ a SIR-type model that accounts for age-dependence and includes realistic contact patterns between age groups. The implementation of NPIs occurs on changed contact patterns, improved isolation, or reduced infectiousness when, e.g., wearing masks. We account for spatial heterogeneity and commuting activities in between regions in Germany, and the testing of commuters is considered as a further NPI. We include the ongoing vaccination process and analyze the effect of the B.1.617.2 (Delta) variant, which is considered to be 40%–60% more infectious then the currently dominant B.1.1.7 (Alpha) variant. We explore different opening scenarios under the ongoing vaccination process by assuming that local restrictions are either lifted in early July or August with or without continued wearing of masks and testing. Our results indicate that we can counteract the resurgence of SARS-CoV-2 despite the Delta variant with appropriate timing for the relaxation of NPIs. In all cases, however, school children are hit the hardest.

1 December 2000 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
ABA Basermann
A Basermann
JCJ Clinckemaillie
J Clinckemaillie
TCT Coupez
T Coupez
JFJ Fingberg
J Fingberg
HDH Digonnet
H Digonnet
CWChris Walshaw
Chris Walshaw

1 January 2015 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
MRMelven Röhrig-Zöllner
Melven Röhrig-Zöllner
JTJonas Thies
Jonas Thies
MKMoritz Kreutzer
Moritz Kreutzer
AAAndreas Alvermann
Andreas Alvermann
APAndreas Pieper
Andreas Pieper
HFHolger Fehske
Holger Fehske
Block variants of the Jacobi--Davidson method for computing a few eigenpairs of a large sparse matrix are known to improve the robustness of the standard algorithm when it comes to computing multiple or clustered eigenvalues. In practice, however, they are typically avoided because the total number of matrix-vector operations increases. In this paper we present the implementation of a block Jacobi--Davidson solver. By detailed performance engineering and numerical experiments we demonstrate that the increase in operations is typically more than compensated by performance gains through better cache usage on modern CPUs, resulting in a method that is both more efficient and robust than its single vector counterpart. The steps to be taken to achieve a block speedup involve both kernel optimizations for sparse matrix and block vector operations, and algorithmic choices to allow using blocked operations in most parts of the computation. We discuss the aspect of avoiding synchronization in the algorithm and sho...