SearcharxivSearch

arXiv subjects

Nils Meyer

Publications and source records attributed to Nils Meyer.

13 recordsLinked to original sources

Performance and Explainability Requirements of Evolutionary Algorithms in Real-World Physics-Informed Optimization

Evolutionary computation offers a variety of tools to solve complex real-world optimization problems. However, research often focuses on smaller, simplified problems and optimization algorithms that sometimes miss expectations in real-world scenarios. Additionally, trust in the applied algorithm and the solutions it provides is often essential in such settings, but requires an understanding of the search process itself. This leads to evolutionary computation often not being seriously considered by practitioners in many application contexts, among them physics-based modeling. In this article, techniques from evolutionary computation are detailed that can alleviate these problems. First, five real-world physics-based optimization problems are introduced and described by domain experts. For each of these, the requirements for the evolutionary algorithm regarding performance and explainability to increase trust and usability are presented. We found that all domain experts expect fast convergence to a good solution and want some explanations for how the results were formed, while other requirements strongly depend on the respective problem. Finally, we present existing approaches that can be leveraged to improve those aspects of evolutionary algorithms but have to our knowledge never been employed in complex real-world scenarios. This implies a gap between both domains that needs to be closed to exploit the full potential of evolutionary computation.

cs.NE

MRHS multigrid solver for Wilson-clover fermions

We describe our implementation of a multigrid solver for Wilson-clover fermions, which increases parallelism by solving for multiple right-hand sides (MRHS) simultaneously. The solver is based on Grid and thus runs on all computing architectures supported by the Grid framework. We present detailed benchmarks of the relevant kernels, such as hopping and clover term on the various multigrid levels, intergrid operators, and reductions. The benchmarks were performed on the JUWELS Booster system at Jülich Supercomputing Centre, which is based on Nvidia A100 GPUs. For example, solving a $24^3\times128$ lattice on 16 GPUs, the overall speedup obtained solely from MRHS is about 10x.

hep-lat

Non-isothermal direct bundle simulation of SMC compression molding with a non-Newtonian compressible matrix

Compression molding of Sheet Molding Compounds (SMC) is a manufacturing process in which a stack of discontinuous fiber-reinforced thermoset sheets is formed in a hot mold. The reorientation of fibers during this molding process can be either described by macroscale models based on Jeffery's equation or by direct mesoscale simulations of individual fiber bundles. In complex geometries and for long fibers, direct bundle simulations outperform the accuracy of state-of-the-art macroscale approaches in terms of fiber orientation and fiber volume fraction. However, it remains to be shown that they are able to predict the necessary compression forces considering non-isothermal, non-Newtonian and compaction behavior. In this contribution, both approaches are applied to the elongational flow in a press rheometer and compared to experiments with 23% glass fiber volume fraction. The results show that both models predict contributions to the total compression force and orientation reasonably well for short flow paths. For long flow paths and thick stacks, complex deformation mechanisms arise and potential origins for deviation between simulations models and experimental observations are discussed. Furthermore, Jeffery's basic model is able to predict orientations similar to the high-fidelity mesoscale model. For planar SMC flow, this basic model appears to be even better suited than the more advanced orientation models with diffusion terms developed for injection molding.

cs.CE

A probabilistic virtual process chain to quantify process-induced uncertainties in Sheet Molding Compounds

The manufacturing process of Sheet Molding Compound (SMC) influences the properties of a component in a non-deterministic fashion. To predict this influence on the mechanical performance, we develop a virtual process chain acting as a digital twin for SMC specimens from compounding to failure. More specifically, we inform a structural simulation with individual fields for orientation and volume fraction computed from a direct bundle simulation of the manufacturing process. The structural simulation employs an interpolated direct deep material network to upscale a tailored SMC damage model. We evaluate hundreds of virtual specimens and conduct a probabilistic analysis of the mechanical performance. We estimate the contribution to uncertainty originating from the process-induced inherent random microstructure and from varying initial SMC stack configurations. Our predicted results are in good agreement with experimental tensile tests and thermogravimetric analysis.

cs.CE

Grid on QPACE 4

In 2020 we deployed QPACE 4, which features 64 Fujitsu A64FX model FX700 processors interconnected by InfiniBand EDR. QPACE 4 runs an open-source software stack. For Lattice QCD simulations we ported the Grid LQCD framework to support the ARM Scalable Vector Extension (SVE). In this contribution we discuss our SVE port of Grid, the status of SVE compilers and the performance of Grid. We also present the benefits of an alternative data layout of complex numbers for the Domain Wall operator.

hep-lat

ECM modeling and performance tuning of SpMV and Lattice QCD on A64FX

The A64FX CPU is arguably the most powerful Arm-based processor design to date. Although it is a traditional cache-based multicore processor, its peak performance and memory bandwidth rival accelerator devices. A good understanding of its performance features is of paramount importance for developers who wish to leverage its full potential. We present an architectural analysis of the A64FX used in the Fujitsu FX1000 supercomputer at a level of detail that allows for the construction of Execution-Cache-Memory (ECM) performance models for steady-state loops. In the process we identify architectural peculiarities that point to viable generic optimization strategies. After validating the model using simple streaming loops we apply the insight gained to sparse matrix-vector multiplication (SpMV) and the domain wall (DW) kernel from quantum chromodynamics (QCD). For SpMV we show why the CRS matrix storage format is not a good practical choice on this architecture and how the SELL-C-sigma format can achieve bandwidth saturation. For the DW kernel we provide a cache-reuse analysis and show how an appropriate choice of data layout for complex arrays can realize memory-bandwidth saturation in this case as well. A comparison with state-of-the-art high-end Intel Cascade Lake AP and Nvidia V100 systems puts the capabilities of the A64FX into perspective. We also explore the potential for power optimizations using the tuning knobs provided by the Fugaku system, achieving energy savings of about 31% for SpMV and 18% for DW.

cs.PF

Performance Modeling of Streaming Kernels and Sparse Matrix-Vector Multiplication on A64FX

The A64FX CPU powers the current number one supercomputer on the Top500 list. Although it is a traditional cache-based multicore processor, its peak performance and memory bandwidth rival accelerator devices. Generating efficient code for such a new architecture requires a good understanding of its performance features. Using these features, we construct the Execution-Cache-Memory (ECM) performance model for the A64FX processor in the FX700 supercomputer and validate it using streaming loops. We also identify architectural peculiarities and derive optimization hints. Applying the ECM model to sparse matrix-vector multiplication (SpMV), we motivate why the CRS matrix storage format is inappropriate and how the SELL-C-sigma format with suitable code optimizations can achieve bandwidth saturation for SpMV.

cs.PF

Lattice QCD on a novel vector architecture

The SX-Aurora TSUBASA PCIe accelerator card is the newest model of NEC's SX architecture family. Its multi-core vector processor features a vector length of 16 kbits and interfaces with up to 48 GB of HBM2 memory in the current models, available since 2018. The compute performance is up to 2.45 TFlop/s peak in double precision, and the memory throughput is up to 1.2 TB/s peak. New models with improved performance characteristics are announced for the near future. In this contribution we discuss key aspects of the SX-Aurora and describe how we enabled the architecture in the Grid Lattice QCD framework.

cs.DC

Lattice QCD on upcoming Arm architectures

Recently Arm introduced a new instruction set called Scalable Vector Extension (SVE), which supports vector lengths up to 2048 bits. While SVE hardware will not be generally available until about 2021, we believe that future SVE-based architectures will have great potential for Lattice QCD. In this contribution we discuss key aspects of SVE and describe how we implemented SVE in the Grid Lattice QCD framework.

hep-lat

SVE-enabling Lattice QCD Codes

Optimization of applications for supercomputers of the highest performance class requires parallelization at multiple levels using different techniques. In this contribution we focus on parallelization of particle physics simulations through vector instructions. With the advent of the Scalable Vector Extension (SVE) ISA, future ARM-based processors are expected to provide a significant level of parallelism at this level.

cs.DC

QPACE 2 and Domain Decomposition on the Intel Xeon Phi

We give an overview of QPACE 2, which is a custom-designed supercomputer based on Intel Xeon Phi processors, developed in a collaboration of Regensburg University and Eurotech. We give some general recommendations for how to write high-performance code for the Xeon Phi and then discuss our implementation of a domain-decomposition-based solver and present a number of benchmarks.

cs.DC

iDataCool: HPC with Hot-Water Cooling and Energy Reuse

iDataCool is an HPC architecture jointly developed by the University of Regensburg and the IBM Research and Development Lab Böblingen. It is based on IBM's iDataPlex platform, whose air-cooling solution was replaced by a custom water-cooling solution that allows for cooling water temperatures of 70C/158F. The system is coupled to an adsorption chiller by InvenSor that operates efficiently at these temperatures. Thus a significant portion of the energy spent on HPC can be recovered in the form of chilled water, which can then be used to cool other parts of the computing center. We describe the architecture of iDataCool and present benchmarks of the cooling performance and the energy (reuse) efficiency.

cs.DC

Level spacings for weakly asymmetric real random matrices and application to two-color QCD with chemical potential

We consider antisymmetric perturbations of real symmetric matrices in the context of random matrix theory and two-color quantum chromodynamics. We investigate the level spacing distributions of eigenvalues that remain real or become complex conjugate pairs under the perturbation. We work out analytical surmises from small matrices and show that they describe the level spacings of large random matrices. As expected from symmetry arguments, these level spacings also apply to the overlap Dirac operator for two-color QCD with chemical potential.

hep-lat