Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallelization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 811 records · Page 45

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗

Space-Time Block Preconditioning for Incompressible Flow

Parallel-in-time methods have become increasingly popular in the simulation of time-dependent numerical PDEs, allowing for the efficient use of additional message passing interface processes when spatial parallelism saturates. Most methods treat the solution and parallelism in space and time separately. In contrast, all-at-once methods solve the full space-time system directly, largely treating time as simply another spatial dimension. All-at-once methods offer a number of benefits over separate treatment of space and time, most notably significantly increased parallelism and faster time to solution (when applicable). However, the development of fast, scalable all-at-once methods has largely been limited to time-dependent (advection-)diffusion problems. This paper introduces the concept of space-time block preconditioning for the all-at-once solution of incompressible flow. By extending well-known concepts of spatial block preconditioning to the space-time setting, we develop a block preconditioner whose application requires the solution of a space-time (advection-)diffusion equation in the velocity block, coupled with a pressure Schur complement approximation consisting of independent spatial solves at each time-step, and a space-time matrix-vector multiplication. The new method is tested on four classical models in incompressible flow. Finally, the results indicate perfect scalability in refinement of spatial and temporal mesh spacing, perfect scalability in nonlinear Picard iteration count when applied to a nonlinear Navier--Stokes problem, and minimal overhead in terms of number of preconditioner applications compared with sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗

h5bench: A unified benchmark suite for evaluating HDF5 I/O performance on pre‐exascale platforms

Summary Parallel I/O is a critical technique for moving data between compute and storage subsystems of supercomputers. With massive amounts of data produced or consumed by compute nodes, high‐performant parallel I/O is essential. I/O benchmarks play an important role in this process; however, there is a scarcity of I/O benchmarks representative of current workloads on HPC systems. Toward creating representative I/O kernels from real‐world applications, we have created h5bench , a set of I/O kernels that exercise hierarchical data format version 5 (HDF5) I/O on parallel file systems in numerous dimensions. Our focus on HDF5 is due to the parallel I/O library's heavy usage in various scientific applications running on supercomputing systems. The various tests benchmarked in the h5bench suite include I/O operations (read and write), data locality (arrays of basic data types and arrays of structures), array dimensionality (one‐dimensional arrays, two‐dimensional meshes, three‐dimensional cubes), I/O modes (synchronous and asynchronous). In this paper, we present the observed performance of h5bench executed along several of these dimensions on existing supercomputers (Cori and Summit) and pre‐exascale platforms (Perlmutter, Theta, and Polaris). h5bench measurements can be used to identify performance bottlenecks and their root causes and evaluate I/O optimizations. As the I/O patterns of h5bench are diverse and capture the I/O behaviors of various HPC applications, this study will be helpful to the broader supercomputing and I/O community.

97 MATHEMATICS AND COMPUTING↗

On the perturbation effect and LET dependence of beam quality correction factors in carbon ion beams

Background: In a recent study, we reported beam quality correction factors, f Q , in carbon ion beams using Monte Carlo (MC) methods for a cylindrical and a parallel-plate ionization chamber (IC). A non-negligible perturbation effect was observed; however, the magnitude of the perturbation correction due to the specific IC subcomponents was not included. Furthermore, the stopping power data presented in the International Commission on Radiation Units and Measurements (ICRU) report 73 were used, whereas the latest stopping power data have been reported in the ICRU report 90. Purpose: The aim of this study was to extend our previous work by computing f Q correction factors using the ICRU 90 stopping power data and by reporting IC-specific perturbation correction factors. Possible energy or linear energy transfer (LET) dependence of the f Q correction factor was investigated by simulating both pristine beams and spread-out Bragg peaks (SOBPs). Methods: The TOol for PArticle Simulation (TOPAS)/GEANT4 MC code was used in this study. A 30 × 30 × 50 cm 3 water phantom was simulated with a uniform 10 × 10 cm 2 parallel beam incident on the surface. A Farmer-type cylindrical IC (Exradin A12) and two parallel-plate ICs (Exradin P11 and A11) were simulated in TOPAS using the manufacturer-provided geometrical drawings. The f Q correction factor was calculated in pristine carbon ion beams in the 150–450 MeV/u energy range at 2 cm depth and in the middle of the flat region of four SOBPs. The k Q correction factor was calculated by simulating the f Qo correction factor in a 60 Co beam at 5 cm depth. The perturbation correction factors due to the presence of the individual IC subcomponents, such as the displacement effect in the air cavity, collecting electrode, chamber wall, and chamber stem, were calculated at 2 cm depth for monoenergetic beams only. Additionally, the mean dose-averaged and track-averaged LET was calculated at the depths at which the f Q was calculated. Results: The ICRU 90 f Q correction factors were reported. The p dis correction factor was found to be significant for the cylindrical IC with magnitudes up to 1.70%. The individual perturbation corrections for the parallel-plate ICs were <1.0% except for the A11 p cel correction at the lowest energy. The f Q correction for the P11 IC exhibited an energy dependence of >1.00% and displayed differences up to 0.87% between pristine beams and SOBPs. Conversely, the f Q for A11 and A12 displayed a minimal energy dependence of <0.50%. The energy dependence was found to manifest in the LET dependence for the P11 IC. A statistically significant LET dependence was found only for the P11 IC in pristine beams only with a magnitude of <1.10%. Conclusions: The perturbation and k Q correction factor should be calculated for the specific IC to be used in carbon ion beam reference dosimetry as a function of beam quality.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned

As the supercomputing landscape diversifies, solutions such as Kokkos to write vendor agnostic applications and libraries have risen in popularity. Kokkos provides a programming model designed for performance portability, which allows developers to write a single source implementation that can run efficiently on various architectures. At its heart, Kokkos maps parallel algorithms to architecture and vendor specific backends written in lower level programming models such as CUDA and HIP. Another approach to writing vendor agnostic parallel code is using OpenMP’s directives based approach, which lets developers annotate code to express parallelism. It is implemented at the compiler level and is supported by all major high performance computing vendors, as well as the primary Open Source toolchains GNU and LLVM. Since its inception, Kokkos has used OpenMP to parallelize on CPU architectures. In this paper, we explore leveraging OpenMP for a GPU backend and discuss the challenges we encountered when mapping the Kokkos APIs and semantics to OpenMP target constructs. As an exemplar workload we chose a simple conjugate gradient solver for sparse matrices. We find that performance on NVIDIA and AMD GPUs varies widely based on details of the implementation strategy and the chosen compiler. Furthermore, the performance of the OpenMP implementations decreases with increasing complexity of the investigated algorithms.

Gayatri, Rahulkumar↗

Kink mechanism in Cu/Nb nanolaminates explored by $\mathcal{in}$ $\mathcal{situ}$ pillar compression

We report Nano metallic laminates (NMLs) exhibit different failure modes depending on the loading conditions due to their mechanical anisotropies. Kinking is a typical failure mode in many NMLs compressed along a layer-parallel direction. However, a detailed description of the microstructure evolution during kink band (KB) formation and an in-depth understanding of the formation mechanisms are lacking. In this work, the KB process is investigated in Cu/Nb NMLs by in situ micro pillar compression in the scanning electron microscope (SEM) along a layer-parallel direction. Post-mortem S/TEM and transmission Kikuchi diffraction (TKD) analyses show that kink banding leads to significant microstructure changes characterized by an accumulation of geometrically necessary dislocations (GNDs) and of tilt geometrically necessary boundaries (GNBs) near KB boundaries (KBBs). The distinct microstructure evolution implies that KB formation is facilitated by the inhomogeneous microstructures resulting in constrained deformation modes. Specifically, dislocations active on slip planes nearly parallel to the interfaces make a major contribution to kink evolution after the onset of kinking. Once layer-parallel slip systems are activated, preexisting lattice dislocations and dislocations nucleating from interfaces will accumulate as GNDs near KBBs via the stochastic storage of lattice dislocations that have certain Burgers vectors. GNDs can further transform into GNBs via cross-slip and climb driven processes near the KBB. Furthermore, GNBs near KBBs can grow by incorporating more GNDs or by coalescence to accommodate the KB evolution. We further hypothesize that microstructural perturbations and their ensuing stresses can initiate KB formation in Cu/Nb NMLs.

36 MATERIALS SCIENCE↗

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗

The Effective Fragment Molecular Orbital Method: Achieving High Scalability and Accuracy for Large Systems

The effective fragment molecular orbital (EFMO) method has been developed to predict the total energy of a very large molecular system accurately (with respect to the underlying quantum mechanical method) and efficiently by taking advantage of the locality of strong chemical interactions and employing a two-level hierarchical parallelism. The accuracy of the EFMO method is partly attributed to the accurate and robust intermolecular interaction prediction between distant fragments, in particular, the many-body polarization and dispersion effects, which require the generation of static and dynamic polarizability tensors by solving the coupled perturbed Hartree–Fock (CPHF) and time-dependent HF (TDHF) equations, respectively. Solving the CPHF and TDHF equations is the main EFMO computational bottleneck due to the inefficient (serial) and I/O-intensive implementation of the CPHF and TDHF solvers. In this work, the efficiency and scalability of the EFMO method are significantly improved with a new CPU memory-based implementation for solving the CPHF and TDHF equations that are parallelized by either message passing interface (MPI) or hybrid MPI/OpenMP. Here, the accuracy of the EFMO method is demonstrated for both covalently bonded systems and noncovalently bound molecular clusters by systematically examining the effects of basis sets and a key distance-related cutoff parameter, R cut . R cut determines whether a fragment pair (dimer) is treated by the chosen ab initio method or calculated using the effective fragment potential (EFP) method (separated dimers). Decreasing the value of Rcut increases the number of separated (EFP) dimers, thereby decreasing the computational effort. It is demonstrated that excellent accuracy (<1 kcal/mol error per fragment) can be achieved when using a sufficiently large basis set with diffuse functions coupled with a small R cut value. With the new parallel implementation, the total EFMO wall time is substantially reduced, especially with a high number of MPI ranks. Given a sufficient workload, nearly ideal strong scaling is achieved for the CPHF and TDHF parts of the calculation. For the first time, EFMO calculations with the inclusion of long-range polarization and dispersion interactions on a hydrated mesoporous silica nanoparticle with explicit water solvent molecules (more than 15k atoms) are achieved on a massively parallel supercomputer using nearly 1000 physical nodes. In addition, EFMO calculations on the carbinolamine formation step of an amine-catalyzed aldol reaction at the nanoscale with explicit solvent effects are presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Experience with the alpaka performance portability library in the CMS software

ion Library for Parallel Kernel Acceleration) is a header-only C++ library that provides performance portability across different back-ends, abstracting the underlying levels of parallelism. It supports serial and parallel execution on CPUs, and extremely parallel execution on NVIDIA, AMD and Intel GPUs.This contribution will show how alpaka is used in the CMS software to develop and maintain a single code base; to use different toolchains to build the code for each supported back-end, and link them into a single application; to seamlessly select the best backend at runtime, and implement portable reconstruction algorithms that run efficiently on CPUs and GPUs from different vendors. It will describe the validation and deployment of the alpaka-based implementation in the CMS High Level Trigger, and highlight how it achieves near-native performance.

Alawieh, Jaafar [CERN]↗

The Generality of the GUGA MRCI Approach in COLUMBUS for Treating Complex Quantum Chemistry

The core part of the program system COLUMBUS allows highly efficient calculations using variational multireference (MR) methods in the framework of configuration interaction with single and double excitations (MR-CISD) and averaged quadratic coupled-cluster calculations (MR-AQCC), based on uncontracted sets of configurations and the graphical unitary group approach (GUGA). The availability of analytic MR-CISD and MR-AQCC energy gradients and analytic nonadiabatic couplings for MR-CISD enables exciting applications including, e.g., investigations of π-conjugated biradicaloid compounds, calculations of multitudes of excited states, development of diabatization procedures, and furnishing the electronic structure information for on-the-fly surface nonadiabatic dynamics. With fully variational uncontracted spin-orbit MRCI, COLUMBUS provides a unique possibility of performing high-level calculations on compounds containing heavy atoms up to lanthanides and actinides. Crucial for carrying out all of these calculations effectively is the availability of an efficient parallel code for the CI step. Configuration spaces of several billion in size now can be treated quite routinely on standard parallel computer clusters. Emerging developments in COLUMBUS, including the all configuration mean energy multiconfiguration self-consistent field method and the graphically contracted function method, promise to allow practically unlimited configuration space dimensions. Spin density based on the GUGA approach, analytic spin-orbit energy gradients, possibilities for local electron correlation MR calculations, development of general interfaces for nonadiabatic dynamics, and MRCI linear vibronic coupling models conclude this overview.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perpendicular magnetofluid theory for magnetically confined plasmas in the collisionless limit

Note that the magnetically confined plasmas in thermonuclear fusion turn to be collisionless. Some particles are trapped by the inhomogeneous equilibrium field or by the waves, while some others keep circulating. One cannot expect the charged particles to be collectively localized in space by collisions along the magnetic field lines. Consequently, the fluid parameters relating to the parallel motion, such as parallel fluid velocity, become inadequate. In this paper, the perpendic- ular magnetofluid theory for magnetically confined plasmas in the collisionless limit is developed. It revises Braginskii’s transport theory by releasing the collisional dominance assumption. In the perpendicular direction, the particle spatial localization is solo resulted from the strong magnetic field, while the finite Larmor radius (FLR) effects are taken into account in the next order. In the parallel direction, the particle mobility feature is fully retained by constructing only the per- pendicular moments. Therefore, besides the FLR effects till order O($k$ $^{2}_{⊥}$ $ρ$ $^{2}_{i}$ ), the Landau damping, the trapped particle effects, and other parallel kinetic effects are all kept in the current formalism. Here, k ⊥ is the perpendicular wave number and ρ i is the ion Larmor radius. Here, the theory can be used both for the analytical and numerical studies of magnetically confined plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

One-dimensional simulation and validation of divertor detachment induced through nitrogen seeding on HL-2A

Divertor detachment is a promising method to solve the power exhaust problem in tokamak devices or even in future magnetic fusion reactors. In this work, a detachment experiment (HL-2A shot #38008) with mixed gas seeding (60% nitrogen and 40% deuterium) is simulated using the SD1D module in BOUT++. In the process from attachment to detachment, the target electron temperature and the target ion saturation current in simulations are found to be consistent with the experimental results measured by Langmuir probes on the target plate. In order to understand the underlying detachment mechanism on HL-2A, this work analyses the role of different particle species in the cases with different seeding rates. It shows that the plasma density varies little and the density of neutrals (D and D 2 ) slightly decreases with the increase of nitrogen seeding rate, such that plasma–neutral interactions cannot effectively reduce plasma energy and plasma momentum in the divertor. The case with a high seeding rate predicts that increasing seeding rate cannot reach a target temperature lower than 2.5 eV, which is the required temperature for strong plasma–molecule interactions. Thus, the plasma–molecule interactions may not be important in the divertor during nitrogen seeding. Here this work also studies the parallel forces including (1) force due to the parallel electric field, (2) friction forces, (3) ion- and electron-thermal forces, and (4) collisional reactions (e.g. charge exchange recombination and ionisation). It is found that the friction force between nitrogen ions and other particle species (primarily D + ) is the dominant force towards the target, while ion- and electron-thermal forces are the dominant force pushing nitrogen ions back to upstream. Parallel forces determine the parallel distribution of nitrogen impurities, and therefore decide the region of nitrogen radiation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Radiative divertor detachment and impurity transport with nitrogen and neon seeding in KSTAR H-mode plasmas

Achieving core-edge compatible divertor detachment is a critical requirement for stable operation in future fusion devices. This study compares nitrogen and neon seeding in KSTAR H-mode plasmas with carbon walls, combining experiments and SOLPS-ITER modelling to evaluate their radiative dissipation and core-edge compatibility. Experimentally, N seeding achieved stronger divertor detachment, with larger reductions in target particle and heat fluxes, a higher divertor radiation fraction, and a lower core radiation fraction than Ne. In contrast, Ne seeding triggered a significant rise in core radiation followed by H–L back transitions, limiting the maximum total radiated power fraction to roughly half that of N. SOLPS-ITER simulations reproduced the experimental trends and revealed that the better core-edge compatibility of N arises from its higher divertor retention in addition to its higher cooling factor. The relative positions of the stagnation points of impurity poloidal velocity and ionization sources did not explain the different divertor compression. Instead, in the present modelling, the higher impurity parallel particle flux, resulting from the higher parallel impurity velocity, explains the stronger nitrogen impurity compression in the divertor region. The parallel temperature distribution with N was more favourable for achieving higher impurity parallel velocity than with Ne, because the impurity velocity is governed by modifications of the main ion flow due to friction and thermal forces, both of which strongly depend on the temperature. Ultimately, this behaviour is attributed to the strongly divertor-localized radiation of N. These results demonstrate that N is more effective than Ne in achieving radiative divertor detachment while maintaining low core contamination in KSTAR, consistent with observations in other present tokamaks.

KSTAR↗

MECHANISMS OF RADIATION CARCINOGENESIS: WHAT IS REALLY INDUCED?

Abstract It has been difficult to understand why the relative risk for cancer decreases with an increase in time since an exposure to radiation. It was recently recognized that this decline can be explained by a parallel shift of the age-related cancer mortality curve toward younger ages. In fact, it has been known for many years that mouse survival curves exhibit a parallel shift toward younger ages following an exposure to radiation, but it was not recognized that the mutation induction theory is incompatible with this parallel shift. This is because a parallel shift in the survival curve implies that all the irradiated individuals are affected, but the mutation induction theory assumes that only a fraction of the irradiated individuals is affected following an exposure to radiation. Thus, it seems likely that the target of radiation action, which leads to carcinogenesis, is not restricted to epithelial cells but includes all of the surrounding cells leading to an altered microenvironment. Since it is repeatedly observed that radiation-exposed normal tissues can stimulate transplanted or spontaneously arising tumor cells to grow faster, worsen the malignant phenotypes and finally kill the host earlier than usual, an exposure to radiation seems most likely to cause tissue inflammation, which creates conditions favorable for the growth of spontaneously arising tumor cells. This new concept suggests that it might be possible to attenuate the extent of radiation carcinogenesis by intervening in tissue inflammatory processes.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Entanglement-enhanced ac magnetometry in the presence of Markovian noise

Entanglement is a resource to improve the sensitivity of quantum sensors. In an ideal case, using an entangled state as a probe to detect target fields, we can beat the standard quantum limit by which all classical sensors are bounded. However, since entanglement is fragile against decoherence, it is unclear whether entanglement-enhanced metrology is useful in a noisy environment. Its benefit is indeed limited when estimating the amplitude of dc magnetic fields under the effect of parallel Markovian decoherence, where the noise operator is parallel to the target field. In this paper, on the contrary, we show an advantage to using an entanglement over the classical strategy under the effect of parallel Markovian decoherence when we try to detect ac magnetic fields. We consider a scenario to induce a Rabi oscillation of the qubits with the target ac magnetic fields. Although we can, in principle, estimate the amplitude of the ac magnetic fields from the Rabi oscillation, the signal becomes weak if the qubit frequency is significantly detuned from the frequency of the ac magnetic field. We show that, by using the Greenberger-Horne-Zeilinger (GHZ) states, we can significantly enhance the signal of the detuned Rabi oscillation even under the effect of parallel Markovian decoherence. Further, our method is based on the fact that the interaction time between the GHZ states and ac magnetic fields scales as 1/L to mitigate the decoherence effect, where L is the number of qubits, which contributes to improving the bandwidth of the detectable frequencies of the ac magnetic fields. Our results pave the way for new applications of entanglement-enhanced ac magnetometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Case Study of Using Kokkos and SYCLs Performance-Portable Frameworks for Milc-Dslash Benchmark on NVIDIA, AMD and Intel GPUs

Six of the top ten supercomputers in the TOP500 list from June 2021 rely on NVIDIA GPUs to achieve their peak compute bandwidth. With the announcement of Aurora, Frontier, and El Capitan, Intel and AMD have also entered the domain of providing GPUs for scientific computing. A consequence of the increased diversity in the GPU landscape is the emergence of portable programming models such as Kokkos, SYCL, OpenCL, and OpenMP, which allow application developers to maintain a single-source code across a diverse range of hardware architectures. While the portable frameworks try to optimize the compute resource usage on a given architecture, it is the programmers responsibility to expose parallelism in an application that can take advantage of thousands of processing elements available on GPUs. In this paper, we introduce a GPU-friendly parallel implementation of Milc-Dslash that exposes multiple hierarchies of parallelism in the algorithm. Milc-Dslash was designed to serve as a benchmark with highly optimized matrix-vector multiplications to measure the resource utilization on the GPU systems. The parallel hierarchies in the Milc-Dslash algorithm are mapped onto a target hardware using Kokkos and SYCL programming models. We present the performance achieved by Kokkos and SYCL implementations of Milc-Dslash on NVIDIA A100 GPU, AMD MI100 GPU, and Intel Gen9 GPU. Additionally, we compare the Kokkos and SYCL performances with those obtained from the versions written in CUDA and HIP programming models on NVIDIA A100 GPU and AMD MI100 GPU, respectively.

Dufek, Amanda S↗