Name: Interdisciplinary Cluster Workshop on GPUs
Start: 2014-04-14T10:30:00+02:00
End: 2014-04-15T17:30:00+02:00
Location: TUM/IGSSE

Interdisciplinary Cluster Workshop on GPUs

from Monday, 14 April 2014 (10:30) to Tuesday, 15 April 2014 (17:30)

Monday, 14 April 2014

10:30 Overview on GPU hardware and CUDA

10:30 - 12:15
Scripting CUDA - Ferdinand Jamitzky (LRZ)
Scripting CUDA
- Ferdinand Jamitzky (LRZ)
10:30 - 11:30
Scripting languages like python are very popular tools for rapid prototyping of applications because of the instant gratification of interpreted languages. In this talk scripting facilities are presented for the use of Cuda-compatible GPGPUs. Examples are given for MATLAB, python and the statistical programming language R. It is also shown how R can be used as a glue language to build larger applications from simple Cuda Kernels with the PGI OpenACC Fortran Compiler.
11:30 Intel Xeon Phi – Intel’s way to go many-core - Volker Weinberg (LRZ)
Intel Xeon Phi – Intel’s way to go many-core
- Volker Weinberg (LRZ)
11:30 - 12:00
Programming accelerators like GPGPUs using languages like OpenCL or CUDA is quite cumbersome and error-prone. Trying to overcome these difficulties, Intel developed their own Many Integrated Core (MIC) architecture. Offering 512-bit wide SIMD vector-registers and a large number of threads the new Intel Xeon Phi coprocessor is designed to retain the programmability and flexibility of the standard x86 architecture on the many-core level. We discuss the basics of the hardware architecture, the main programming models and the new Intel Xeon Phi based cluster “SuperMIC“ at LRZ.
12:00 Discussion
Discussion
12:00 - 12:15

12:15 Lunch break
Lunch break
12:15 - 14:00
14:00 AmpTools: A GPU-accelerated toolkit for amplitude analysis - Matthew Shepherd (U Indiana)
AmpTools: A GPU-accelerated toolkit for amplitude analysis
- Matthew Shepherd (U Indiana)
14:00 - 15:00
Amplitude analysis, commonly used in hadron spectroscopy to study resonance properties, necessarily involves and unbinned maximum likelihood fit. With modern experiments it is not unusual to attempt to fit of order a million events to a model with tens of free parameters. The repeated likelihood evaluation for each event that is necessary at each fit iteration can be dramatically accelerated by performing the calculations in parallel. We will discuss the general computational problem of amplitude analysis and performance attained by parallelization with both a single GPU and a cluster of GPUs.
Maximum likelihood methods on GPUs

14:00 - 18:15
15:00 Log-likelihood based event reconstruction in IceCube - David Boersma (U Uppsala)
Log-likelihood based event reconstruction in IceCube
- David Boersma (U Uppsala)
15:00 - 16:00
Overview of the currently used CPU-based algorithms to determine the type and parameters of each recorded event in IceCube. Many of these algorithms are implemented in a framework called "Gulliver". Whether or not this framework is suitable for GPU solutions probably depends on which strategy for parallellization is chosen.
16:00 Coffee break
Coffee break
16:00 - 16:30
16:30 Parallelization of maximum likelihood fits on CPU and GPU: Algorithms and Technologies - Alfio Lazzaro (CERN)
Parallelization of maximum likelihood fits on CPU and GPU: Algorithms and Technologies
- Alfio Lazzaro (CERN)
16:30 - 17:30
Data analyses based on maximum likelihood fits are commonly used for fitting statistical models to data samples. Large data samples and complex likelihood functions models can be very time-consuming tasks. Therefore, it becomes particularly important to speed-up the evaluation of the likelihood functions. In this presentation Alfio will present an algorithm which benefits from data vectorization and parallelization on CPU and GPU. Thereafter he will discuss the implementation technologies for porting the application on both devices.
17:30 GPU-accelerated Partial-Wave Analysis in Hadron Spectroscopy - Boris Grube (TUM)
GPU-accelerated Partial-Wave Analysis in Hadron Spectroscopy
- Boris Grube (TUM)
17:30 - 18:00
The study of the excitation spectra of baryons and mesons is an active field of hadron physics, where one wants to learn more about how hadrons are composed of quarks and gluons and how exactly confinement works. In typical experiments many different of these excited hadrons are produced at the same time. They appear as short-lived resonances that decay into final-state particles measured by the detector. Partial-wave analysis methods are used in order to disentangle the observed mixture of the contributing resonances, by decomposing the measured kinematic distributions of the decay particles into partial waves with well-defined spin and parity quantum numbers. This spin-parity decomposition is an expansion into a well-defined set of functions, not unlike a Fourier analysis. The coefficients of the expansion describe the strengths and phases of each partial wave and are determined by a multi-dimensional likelihood fit to the measured kinematic distributions which typically contains about 100 free parameters. Due to the high dimensionality of the problem (up to 11 dimensions), the large number of fit parameters (order of 200), and the large amount of data (up to 10^8 events) the computation of the likelihood function is expensive. Furthermore, in order to assess systematic errors, fits have to be repeated with a variety of models and on a number of data sets. Therefore speed is an issue. GPGPU computing can help to widen this bottleneck and also enables new analysis schemes that would be prohibitively expensive on CPU-based systems.
18:00 Discussion
Discussion
18:00 - 18:15

18:15 Dinner: Bavarian Brotzeit
Dinner: Bavarian Brotzeit
18:15 - 19:45
Tuesday, 15 April 2014
09:00 Fast vectorized and GPU-accelerated Algorithms for multiple applications - David Rohr (FIAS)
Fast vectorized and GPU-accelerated Algorithms for multiple applications
- David Rohr (FIAS)
09:00 - 10:00
With processor clock speeds having stagnated, parallel computing architectures like GPUs have achieved a breakthrough in recent years. Modern clusters are often designed heterogeneously and offer different processors for different applications. In order not to waste the available compute power, highly efficient programs are mandatory. The talk is about the development of fast algorithms and their implementations on modern CPUs and GPUs, about the maximum achievable efficiency with respect to peak performance and to power consumption respectively, and about feasibility and limits of programs for CPUs, GPUs, and heterogeneous systems. Three totally different applications from distinct fields are presented. -The ALICE experiment at the LHC studies heavy-ion collisions at high rates of several hundred Hz, while every collision produces thousands of particles, whose trajectories must be reconstructed in real time by the ALICE High Level Trigger (HLT). For this purpose, ALICE HLT TPC track reconstruction and track merging have been adapted for GPUs outperforming the fastest available CPUs by about a factor three. Since the beginning of 2012, the tracker has been running in nonstop operation on 64 nodes of the ALICE HLT providing full real-time track reconstruction. -The Linpack benchmark employs matrix multiplication (DGEMM) to solve a dense system of linear equations and is the standard tool for ranking compute clusters. Heterogeneous multi-GPU-enabled versions of DGEMM and Linpack have been developed supporting CAL, CUDA, and OpenCL as backend. Employing this implementation, the LOEWE-CSC cluster ranked place 22 in the November 2010 Top500 list of the fastest supercomputers, and the Sanam cluster achieved the second place in the November 2012 Green500 list of the most power efficient supercomputers. -Failure erasure coding enables failure tolerant data storage and is an absolute necessity for present-day computer infrastructure. Fast encoding implementations are presented, which use exclusively either integer or logical vector instructions. Depending on certain parameters, they always hit different hard limits of the hardware: either the maximum attainable memory bandwidth, or the peak instruction throughput, or the PCI Express bandwidth limit when GPUs or FPGAs are employed. The examples demonstrate that in most cases GPU implementations can be as efficient as their CPU counterparts with respect to the available peak performance. With respect to costs and power consumption, they are much more efficient. For this purpose, complex tasks must be split in serial as well as parallel parts such that multithreaded pipelines and asynchronous DMA transfers can hide CPU bound tasks ensuring continuous GPU kernel execution. Few cases are identified where this is not possible due to PCI Express limitations or not reasonable because practical GPU languages are missing.
Selected topics on GPUs

09:00 - 10:00
10:00 GPU Optimization of Pseudo Random Number Generators for Random Ordinary Differential Equations - Christoph Riesinger (TUM)
GPU Optimization of Pseudo Random Number Generators for Random Ordinary Differential Equations
- Christoph Riesinger (TUM)
10:00 - 10:30
Solving differential equations with stochastic terms involves a massive use of pseudo random numbers. The inherent potential for vectorization of such an application is used to its full extent on GPU accelerator hardware. A representative set of pseudo random number generators for uniformly and normally distributed pseudo random numbers has been implemented, optimized, and benchmarked. The resulting optimized variants outperform standard library implementations on GPUs.
Minimizers and sampling methods with/without GPUs

10:00 - 10:45

10:30 Discussion
Discussion
10:30 - 10:45

10:45 Coffee break
Coffee break
10:45 - 11:15
11:15 A versatile tomographic forward and back projection approach on Multi-GPUs - Andreas Fehringer (TUM)
A versatile tomographic forward and back projection approach on Multi-GPUs
- Andreas Fehringer (TUM)
11:15 - 12:15
Iterative tomographic reconstruction gets more and more into the focus of interest for x-ray computed tomography as parallel high-performance computing finds its way into compact and affordable computing systems in form of GPU devices. However, when it comes to the point of high-resolution x-ray computed tomography, e.g. measured at synchrotron facilities, the limited memory and bandwidth of such devices are soon stretched to their limits. Especially keeping the core part of tomographic reconstruction, the projectors, both versatile and fast for large datasets is challenging. Therefore, we demonstrate a multi-GPU accelerated forward and back projector based on projection matrices and taking advantage of two concepts to distribute large datasets into smaller units. A novel ultrafast precalculation kernel prevents unnecessary data transfers for cone-beam geometries. Contributors: Tobias Lasser, Peter B. Noël and Franz Pfeiffer
Image processing

11:15 - 15:00

12:15 Lunch break
Lunch break
12:15 - 14:00
14:00 High Performance visualization of astrophysical data - Claudio Gheller (ETHZ)
High Performance visualization of astrophysical data
- Claudio Gheller (ETHZ)
14:00 - 14:30
The talk will focus on exploitation of emerging GPU-enabled, hybrid HPC architectures for scientific data visualization. We employ Splotch - a rendering algorithm that allows production of high quality imagery and supports very large-scale datasets. Splotch can exploit heterogeneous supercomputing architectures by means of an effective combination of MPI, for distributed computing, OpenMP, on shared memory systems, and CUDA, to use GPUs. We specifically focus on the CUDA implementation of Splotch referring to the underlying performance model for data transfers, computations and memory access and we presents the results obtained in a number of tests and benchmarks which measure the performance and the scalability of our algorithm.
14:30 Current application of CUDA/OpenCL in IceCube simulation and analysis - David Boersma (U Uppsala)
Current application of CUDA/OpenCL in IceCube simulation and analysis
- David Boersma (U Uppsala)
14:30 - 15:00
GPUs are already used extensively (and successfully) in IceCube, e.g. the simulation of light propagation in ice and for analyzing features in a skymap.
15:00 GPU experiences at the RZG - Tilman Dannert (RZG)
GPU experiences at the RZG
- Tilman Dannert (RZG)
15:00 - 15:30
The actual supercomputer of the Max-Planck Society located at the Garching Computing Center has a significant part of nodes accelerated with NVidia Kepler GPUs. This infrastructure at the RZG will be presented. To use this computing power, two codes from astrophysics and plasma physics have been investigated for a porting on this new architecture. In the presentation the experiences and results from this effort will be shown.
Local activities and extreme applications

15:00 - 16:00
15:30 Training of the Neural Network z-Vertex Trigger for the Belle II Experiment - Neuhaus Sara (MPP)
Training of the Neural Network z-Vertex Trigger for the Belle II Experiment
- Neuhaus Sara (MPP)
15:30 - 16:00
Separating signal and background at the first level, the trigger is a crucial component of a particle physics experiment. For the Belle II experiment, which is currently under construction at the SuperKEKB B-Factory in Tsukuba (Japan), especially the z-coordinate of the vertex position is an ideal criterion to reject charged background tracks. Classical triggering methods lack in accuracy for this parameter, but simulation studies with multi layer perceptrons have demonstrated a significant improvement that can be achieved using machine learning. When parallel hardware (e.g. FPGA) is used, the inherent parallel structure of neural networks is well suited for the tight timing constraints of the trigger system. Excessive parallelization is also possible in various stages of the training procedure. Different parallelization approaches will be presented including pattern parallel training based on OpenMP and node parallel execution currently planned for the hardware realization.

Choose timezone