Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peter Messmer

dblp:74/3479 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 63% GPUs and heterogeneous computing · 29% Parallel and multicore computing · 9%
Computer graphics and multimedia
2 papers
Virtual and augmented reality · 82% Visualization and visual analytics · 18%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Virtual and augmented reality
immersive visualization
0.312017
Towards a design space characterizing workflows that take advantage of immersive visualization · VR 2017
High-performance computing › finite element method
finite element simulation
0.112012
Forward and adjoint simulations of seismic wave propagation on emerging large-scale GPU architectures · SC 2012
GPUs and heterogeneous computing
GPU computing
0.112012
Forward and adjoint simulations of seismic wave propagation on emerging large-scale GPU architectures · SC 2012
High-performance computing
scientific computing systems
0.112012
Forward and adjoint simulations of seismic wave propagation on emerging large-scale GPU architectures · SC 2012
Data mining › visualization
visual data mining
0.112008
High performance multivariate visual data exploration for extremely large data · SC 2008
Parallel and multicore computing › MPI
MPI-based parallelization
0.012012
Forward and adjoint simulations of seismic wave propagation on emerging large-scale GPU architectures · SC 2012
High-performance computing
distributed memory systems
0.012008
High performance multivariate visual data exploration for extremely large data · SC 2008

Methods — techniques the papers use, named apart from their topics

parallel coordinates · 0.2index/query technology · 0.2mesh coloring · 0.1atomic updates · 0.1MPI · 0.1CUDA · 0.1
YearPublicationVenuePosition
2017 Towards a design space characterizing workflows that take advantage of immersive visualization
abstract
Immersive visualization (IV) fosters the creation of mental images of a data set, a scene, a procedure, etc. We devise an initial version of a design space for categorizing workflows that take advantage of IV. From this categorization, specific requirements for an actual, seamless IV-integration can be derived. We validate the design space with three workflows investigated in our research projects.
Tom Vierjahn, Daniel Zielasko, Kees van Kooten, Peter Messmer, Bernd Hentschel 0001, Torsten W. Kuhlen, Benjamin Weyers
VR4
2012 Forward and adjoint simulations of seismic wave propagation on emerging large-scale GPU architectures
abstract
Computational seismology is an area of wide sociological and economic impact, ranging from earthquake risk assessment to subsurface imaging and oil and gas exploration. At the core of these simulations is the modeling of wave propagation in a complex medium. Here we report on the extension of the high-order finite-element seismic wave simulation package SPECFEM3D to support the largest scale hybrid and homogeneous supercomputers. Starting from an existing highly tuned MPI code, we migrated to a CUDA version. In order to be of immediate impact to the science mission of computational seismologists, we had to port the entire production package, rather than just individual kernels. One of the challenges in parallelizing finite element codes is the potential for race conditions during the assembly phase. We therefore investigated different methods such as mesh coloring or atomic updates on the GPU. In order to achieve strong scaling, we needed to ensure good overlap of data motion at all levels, including internode and host-accelerator transfers. Finally we carefully tuned the GPU implementation. The new MPI/CUDA solver exhibits excellent scalability and achieves speedup on a node-to-node basis over the carefully tuned equivalent multi-core MPI solver. To demonstrate the performance of both the forward and adjoint functionality, we present two case studies run on the Cray XE6 CPU and Cray XK6 GPU architectures up to 896 nodes: (1) focusing on most commonly used forward simulations, we simulate seismic wave propagation generated by earthquakes in Turkey, and (2) testing the most complex seismic inversion type of the package, we use ambient seismic noise to image 3-D crust and mantle structure beneath western Europe.
Max Rietmann, Peter Messmer, Tarje Nissen-Meyer, Daniel Peter 0001, Piero Basini, Dimitri Komatitsch, Olaf Schenk, Jeroen Tromp, Lapo Boschi, Domenico Giardini
SC2
2009 Parallel data-locality aware stencil computations on modern micro-architectures
abstract
Novel micro-architectures including the Cell Broadband Engine Architecture and graphics processing units are attractive platforms for compute-intensive simulations. This paper focuses on stencil computations arising in the context of a biomedical simulation and presents performance benchmarks on both the Cell BE and GPUs and contrasts them with a benchmark on a traditional CPU system. Due to the low arithmetic intensity of stencil computations, typically only a fraction of the peak performance of the compute hardware is reached. An algorithm is presented, which reduces the bandwidth requirements and thereby improves performance by exploiting temporal locality of the data. We report on performance improvements over CPU implementations.
Matthias Christen, Olaf Schenk, Esra Neufeld, Peter Messmer, Helmar Burkhart
IPDPS4
2008 Automated Analysis for Detecting Beams in Laser Wakefield Simulations
abstract
Laser wakefield particle accelerators have shown the potential to generate electric fields thousands of times higher than those of conventional accelerators. The resulting extremely short particle acceleration distance could yield a potential new compact source of energetic electrons and radiation, with wide applications from medicine to physics. Physicists investigate laser-plasma internal dynamics by running particle-in-cell simulations; however, this generates a large dataset that requires time-consuming, manual inspection by experts in order to detect key features such as beam formation. This paper describes a framework to automate the data analysis and classification of simulation data. First, we propose a new method to identify locations with high density of particles in the space-time domain, based on maximum extremum point detection on the particle distribution. We analyze high density electron regions using a lifetime diagram by organizing and pruning the maximum extrema as nodes in a minimum spanning tree. Second, we partition the multivariate data using fuzzy clustering to detect time steps in a experiment that may contain a high quality electron beam. Finally, we combine results from fuzzy clustering and bunch lifetime analysis to estimate spatially confined beams. We demonstrate our algorithms successfully on four different simulation datasets.
Daniela Ushizima, Oliver Rübel, Prabhat, Gunther H. Weber, E. Wes Bethel, Cecilia R. Aragon, Cameron G. R. Geddes, Estelle Cormier-Michel, Bernd Hamann, Peter Messmer, Hans Hagen
ICMLA10
2008 High performance multivariate visual data exploration for extremely large data
abstract
One of the central challenges in modern science is the need to quickly derive knowledge and understanding from large, complex collections of data. We present a new approach that deals with this challenge by combining and extending techniques from high performance visual data analysis and scientific data management. This approach is demonstrated within the context of gaining insight from complex, time-varying datasets produced by a laser wakefield accelerator simulation. Our approach leverages histogram-based parallel coordinates for both visual information display as well as a vehicle for guiding a data mining operation. Data extraction and subsetting are implemented with state-of-the-art index/query technology. This approach, while applied here to accelerator science, is generally applicable to a broad set of science applications, and is implemented in a production-quality visual data analysis infrastructure. We conduct a detailed performance analysis and demonstrate good scalability on a distributed memory Cray XT4 system.
Oliver Rübel, Prabhat, Kesheng Wu, Hank Childs, Jeremy S. Meredith, Cameron G. R. Geddes, Estelle Cormier-Michel, Sean Ahern, Gunther H. Weber, Peter Messmer, Hans Hagen, Bernd Hamann, E. Wes Bethel
SC10