Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel Supercomputers”

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 55 records · Page 3

Simulations of future particle accelerators: issues and mitigations

The ever increasing demands placed upon machine performance have resulted in the need for more comprehensive particle accelerator modeling. Computer simulations are key to the success of particle accelerators. Many aspects of particle accelerators rely on computer modeling at some point, sometimes requiring complex simulation tools and massively parallel supercomputing. Examples include the modeling of beams at extreme intensities and densities (toward the quantum degeneracy limit), and with ultra-fine control (down to the level of individual particles). In the future, adaptively tuned models might also be relied upon to provide beam measurements beyond the resolution of existing diagnostics. Much time and effort has been put into creating accelerator software tools, some of which are highly successful. However, there are also shortcomings such as the general inability of existing software to be easily modified to meet changing simulation needs. In this paper possible mitigating strategies are discussed for issues faced by the accelerator community as it endeavors to produce better and more comprehensive modeling tools. This includes lack of coordination between code developers, lack of standards to make codes portable and/or reusable, lack of documentation, among others.

43 PARTICLE ACCELERATORS↗

Electronic Excitation Response of DNA to High-Energy Proton Radiation in Water

The lack of molecular-level understanding for the electronic excitation response of DNA to charged particle radiation, such as high-energy protons, remains a fundamental scientific bottleneck in advancing proton and other ion beam cancer therapies. In particular, the dependence of different types of DNA damage on high-energy protons represents a significant knowledge void. Here, in this work, we employ first-principles real-time time-dependent density functional theory simulation, using a massively parallel supercomputer, to unravel the quantum-mechanical details of the energy transfer from high-energy protons to DNA in water. The calculations reveal that protons deposit significantly more energy onto the DNA sugar-phosphate side chains than onto the nucleobases, and greater energy transfer is expected onto the DNA side chains than onto water. As a result of this electronic stopping process, highly energetic holes are generated on the DNA side chains as a source of oxidative damage.

74 ATOMIC AND MOLECULAR PHYSICS↗

High-throughput determination of Hubbard $U$ and Hund $J$ values for transition metal oxides via the linear response formalism

DFT+U provides a convenient, cost-effective correction for the self-interaction error (SIE) that arises when describing correlated electronic states using conventional approximate density functional theory (DFT). The success of a DFT+U(+J) calculation hinges on the accurate determination of its Hubbard U and Hund J parameters, and the linear response (LR) methodology has proven to be computationally effective and accurate for calculating these parameters. This study provides a high-throughput computational analysis of the U and J values for transition metal d-electron states in a representative set of over 1000 magnetic transition metal oxides (TMOs), providing a frame of reference for researchers who use DFT+U to study transition metal oxides. In order to perform this high-throughput study, an ATOMATE workflow is developed for calculating U and J values automatically on massively parallel supercomputing architectures. Here, to demonstrate an application of this workflow, the spin-canting magnetic structure and unit cell parameters of the multiferroic olivine LiNiPO4 are calculated using the computed Hubbard U and Hund J values for Ni-d and O-p states, and are compared with experiment. Both the Ni-d U and J corrections have a strong effect on the Ni-moment canting angle. Additionally, including a O-pU value results in a significantly improved agreement between the computed lattice parameters and experiment

36 MATERIALS SCIENCE↗

A domain-specific compiler for a parallel multiresolution adaptive numerical simulation environment

This paper describes the design and implementation of a layered domain-specific compiler to support MADNESS---Multiresolution ADaptive Numerical Environment for Scientific Simulation. MADNESS is a high-level software environment for the solution of integral and differential equations in many dimensions, using adaptive and fast harmonic analysis methods with guaranteed precision. MADNESS uses k-d trees to represent spatial functions and implements operators like addition, multiplication, differentiation, and integration on the numerical representation of functions. The MADNESS runtime system provides global namespace support and a task-based execution model including futures. MADNESS is currently deployed on massively parallel supercomputers and has enabled many science advances. Due to the highly irregular and statically unpredictable structure of the k-d trees representing the spatial functions encountered in MADNESS applications, only purely runtime approaches to optimization have previously been implemented in the MADNESS framework. This paper describes a layered domain-specific compiler developed to address some performance bottlenecks in MADNESS. The newly developed static compile-time optimizations, in conjunction with the MADNESS runtime support, enable significant performance improvement for the MADNESS framework.

Rajbhandari, Samyam↗

E4D_RT

Time-lapse ERT imaging for monitoring both natural and engineered subsurface processes has advanced rapidly over the past 15-20 years. However, imaging results generally required a significant amount of manual and computational effort, and therefore were not available while the process was occurring. Although the value of real-time imaging was recognized, several obstacles prevented it's implementation. E4D_RT addresses these obstacles by 1) providing specialized algorithms that negate the need for user intervention, thereby automating the time-lapse data processing steps, 2) linking field data collection systems with parallel supercomputing systems via wireless data transfer link, and 3) addressing the computational burdens by utilizing distributed memory supercomputing resources, thereby enabling rapid data processing and imaging results.

Source record↗

Improved Transport Processes for CCSM

In atmospheric modeling, global spectral methods have dominated weather and climate simulation for the past two decades. However, global methods based upon the spherical harmonic basis functions require expensive non-local communication and thus have difficulty in exploiting the full potential of current high-performance parallel computers. The primary objective of HOMME ((11)) is the development of a class of high-order scalable conservative atmospheric models for climate and general atmospheric modeling applications. The spatial discretizations are based on continuous Galerkin (spectral element method) and discontinuous Galerkin (DG). These are local methods based on high-order accurate spectral basis functions which have been shown to perform well on massively parallel supercomputers at any resolution (18). HOMME employs a cubed-sphere geometry (26) exhibiting none of the singularities present in conventional latitude-longitude spherical geometries. The element based formulation enables the use of general curvilinear geometries and adaptive conforming or non-conforming meshes.

54 ENVIRONMENTAL SCIENCES↗

Cielo Computational Environment Usage Model: With Mappings to ACE Requirements for the General Availability User Environment Capabilities (Release V.1.1)

Cielo is a massively parallel supercomputer funded by the DOE/NNSA Advanced Simulation and Computing (ASC) program, and operated by the Alliance for Computing at Extreme Scale (ACES), a partnership between Los Alamos National Laboratory (LANL) and Sandia National Laboratories (SNL). The primary Cielo compute platform is physically located at Los Alamos National Laboratory. This Cielo Computational Environment Usage Model documents the capabilities and the environment to be provided for the Q1 FY12 Level 2 Cielo Capability Computing (CCC) Platform Production Readiness Milestone. This document describes specific capabilities, tools, and procedures to support both local and remote users. The model is focused on the needs of the ASC user working in the secure computing environments at Lawrence Livermore National Laboratory (LLNL), Los Alamos National Laboratory, or Sandia National Laboratories, but also addresses the needs of users working in the unclassified environment. The Cielo Computational Environment Usage Model maps the provided capabilities to the tri-Lab ASC Computing Environment (ACE) Version 8.0 requirements. The ACE requirements reflect the high performance computing requirements for the Production Readiness Milestone user environment capabilities of the ASC community. A description of ACE requirements met, and those requirements that are not met, are included in each section of this document. The Cielo Computing Environment, along with the ACE mappings, has been issued and reviewed throughout the tri-Lab community.

97 MATHEMATICS AND COMPUTING↗

Stochastic Simulation of Complex Fluid Flows (Progress Report for period 07/01/2016 - 06/30/2018)

At a microscopic scale, fluids are composed of molecules whose positions and velocities are random. This gives rise to thermal fluctuations that span the whole range of scales from the microscopic through the mesoscopic, and even the macroscopic. The inclusion of thermal fluctuations is crucial in multi-scale models, which are an important theme in the research program of the DOE Office of Science, and in particular the ASCR Applied Mathematics program's priority focus area on modeling of complex systems involving processes that span vastly different time and/or length scales. In this five-year Early Career project, the PI Aleksandar Donev and collaborators developed computational algorithms for modeling complex fluid mixtures at small scales using a formulation based on fluctuating hydrodynamics. Novel computational methods were developed to model complex fluids with increasing physical complexity, starting from binary miscible and immiscible mixtures, going through multispecies non-reactive and reactive mixtures, and culminating with reactive electrolytes mixtures of neutral molecules and ions. In close collaboration with the group of John Bell at Lawrence Berkeley National Laboratory, the methods were implemented in a scalable computational framework suitable for modern parallel supercomputers, and made publicly available on github. A number of physical examples in which giant nonequilibrium fluctuations are improtant were studied, with a special focus on instabilities at a liquid-liquid interface driven by gravity, diffusion, reactions, and/or electric fields. The methods and codes developed in this project are expected to enable other novel applications in the DOE Basic Energy Sciences program, and engineering sciences more broadly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-Consistant Numerical Modeling of E-Cloud Driven Instability of a Bunch Train in the CERN SPS

The simulation package WARP-POSINST was recently upgraded for handling multiple bunches and modeling concurrently the electron cloud buildup and its effect on the beam, allowing for direct self-consistent simulation of bunch trains generating, and interacting with, electron clouds. We have used the WARP-POSINST package on massively parallel supercomputers to study the growth rate and frequency patterns in space-time of the electron cloud driven transverse instability for a proton bunch train in the CERN SPS accelerator. Results suggest that a positive feedback mechanism exists between the electron buildup and the e-cloud driven transverse instability, leading to a net increase in predicted electron density. Comparisons to selected experimental data are also given. Electron clouds have been shown to trigger fast growing instabilities on proton beams circulating in the SPS and other accelerators. So far, simulations of electron cloud buildup and their effects on beam dynamics have been performed separately. This is a consequence of the large computational cost of the combined calculation due to large space and time scale disparities between the two processes. We have presented the latest improvements of the simulation package WARP-POSINST for the simulation of self-consistent ecloud effects, including mesh refinement, and generation of electrons from gas ionization and impact at the pipe walls. We also presented simulations of two consecutive bunches interacting with electrons clouds in the SPS, which included generation of secondary electrons. The distribution of electrons in front of the first beam was initialized from a dump taken from a preceding buildup calculation using the POSINST code. In this paper, we present an extension of this work where one full batch of 72 bunches is simulated in the SPS, including the entire buildup calculation and the self-consistent interaction between the bunches and the electrons. Comparisons to experimental data are also given.

43 PARTICLE ACCELERATORS↗

Direct Numerical Modeling of E-Cloud Driven Instability of a Bunch Train in the CERN SPS

The simulation package WARP-POSINST was recently upgraded for handling multiple bunches and modeling concurrently the electron cloud buildup and its effect on the beam, allowing for direct self-consistent simulation of bunch trains generating, and interacting with, electron clouds. We have used the WARP-POSINST package on massively parallel supercomputers to study the buildup and interaction of electron clouds with a proton bunch train in the CERN SPS accelerator. Results suggest that a positive feedback mechanism exists between the electron buildup and the e-cloud driven transverse instability, leading to a net increase in predicted electron density. Electron clouds have been shown to trigger fast growing instabilities on proton beams circulating in the SPS and other accelerators. So far, simulations of electron cloud buildup and their effects on beam dynamics have been performed separately. This is a consequence of the large computational cost of the combined calculation due to large space and time scale disparities between the two processes. We have presented the latest improvements of the simulation package WARP-POSINST for the simulation of self-consistent ecloud effects, including mesh refinement, and generation of electrons from gas ionization and impact at the pipe walls. We also presented simulations of two consecutive bunches interacting with electrons clouds in the SPS, which included generation of secondary electrons. The distribution of electrons in front of the first beam was initialized from a dump taken from a preceding buildup calculation using the POSINST code. In this paper, we present an extension of this work where one full batch of 72 bunches is simulated in the SPS, including the entire buildup calculation and the self-consistent interaction between the bunches and the electrons.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Collective network for computer structures

A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

97 MATHEMATICS AND COMPUTING↗

Collective network for computer structures

A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to the needs of a processing algorithm.

97 MATHEMATICS AND COMPUTING↗

Method and apparatus for offloading compute resources to a flash co-processing appliance

Solid-State Drive (SSD) burst buffer nodes are interposed into a parallel supercomputing cluster to enable fast burst checkpoint of cluster memory to or from nearby interconnected solid-state storage with asynchronous migration between the burst buffer nodes and slower more distant disk storage. The SSD nodes also perform tasks offloaded from the compute nodes or associated with the checkpoint data. For example, the data for the next job is preloaded in the SSD node and very fast uploaded to the respective compute node just before the next job starts. During a job, the SSD nodes perform fast visualization and statistical analysis upon the checkpoint data. The SSD nodes can also perform data reduction and encryption of the checkpoint data.

97 MATHEMATICS AND COMPUTING↗

Architecture and method for a burst buffer using flash technology

A parallel supercomputing cluster includes compute nodes interconnected in a mesh of data links for executing an MPI job, and solid-state storage nodes each linked to a respective group of the compute nodes for receiving checkpoint data from the respective compute nodes, and magnetic disk storage linked to each of the solid-state storage nodes for asynchronous migration of the checkpoint data from the solid-state storage nodes to the magnetic disk storage. Each solid-state storage node presents a file system interface to the MPI job, and multiple MPI processes of the MPI job write the checkpoint data to a shared file in the solid-state storage in a strided fashion, and the solid-state storage node asynchronously migrates the checkpoint data from the shared file in the solid-state storage to the magnetic disk storage and writes the checkpoint data to the magnetic disk storage in a sequential fashion.

97 MATHEMATICS AND COMPUTING↗

Collective network for computer structures

A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

Blumrich, Matthias A.↗

Chapter Three - GronOR Nonorthogonal Configuration Interaction Calculations at Exascale

This chapter describes the implementation and benchmarking of a new software code for nonorthogonal configuration interaction calculations. GronOR is named after the University of Groningen and Oak Ridge National Laboratory, the two institutions that are collaborating on the development of this code for the largest massively parallel supercomputers for open science. The basic implementation approach is described and preliminary benchmarking results are given as obtained from early access to Summit, the next Oak Ridge Leadership Computing Facility's supercomputer with 200 PFlop.

Straatsma, T.P.↗

Class network routing

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

97 MATHEMATICS AND COMPUTING↗

Tutorial: Parallel simulation on supercomputers

This tutorial introduces typical hardware and software characteristics of extant and emerging supercomputing platforms, and presents issues and solutions in executing large-scale parallel discrete-event simulation scenarios on such high performance computing systems. Covered topics include synchronization, model organization, example applications, and observed performance from illustrative large-scale runs.

Perumalla, Kalyan S.↗