Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel computers.”

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 595 records · Page 33

MPMC and MCMD: Free High-Performance Simulation Software for Atomistic Systems

Advancements in parallel computing and hardware have allowed computational exploration of chemical systems of interest with unprecendented accuracy and efficiency. The typical development of molecular simulation software is initially inspired by a particular scientific inquiry. The softwares presented herein, MPMC (Massively Parallel Monte Carlo) and MCMD (Monte Carlo/Molecular Dynamics) were born out of a pursuit to simulate condensed phase physical and chemical interactions in porous materials. MPMC first began in 2005 and has been used for dozens of published results in the literature but has not yet been introduced in a standalone paper. MCMD is a more recent expansion and re-write with some published work, focused on adding molecular dynamics algorithms for transport and other time-dependent properties of chemical systems. Each software functions as a standalone with some unique and other overlapping features. Here, a driving aim of this work is to consider periodic, long-range polarization effects in classical simulation, and both codes are optimized to perform such calculations. Sample results will be presented which highlight methodically that inclusion of explicit polarization produces simulation results with predictive power which in general are in greater agreement with experiment than non-polarizable analogous simulations.

97 MATHEMATICS AND COMPUTING↗

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗

RAPID

Parallel computer code for the simulator for dynamics of power systems which has the capability to initiate the system and create different faults for the dynamic analysis. The code is based on time-parallel method (Parareal) with Adaptive Method Reduction (AMR). The coarse solvers for the Parareal algorithm include several Semi Analytical Solution methods. Also, Integrated simulation of coupled transmission and distribution systems can be studied.

Simunovic, Srdjan [Oak Ridge National Lab. (ORNL),↗

The Secret Life of Quarks, Final Report for the University of North Carolina at Chapel Hill

This final report summarizes activities and results at the University of North Carolina as part of the the SciDAC-2 Project The Secret Life of Quarks: National Computational Infrastructure for Lattice Quantum Chromodynamics. The overall objective of the project is to construct the software needed to study quantum chromo- dynamics (QCD), the theory of the strong interactions of subatomic physics, and similar strongly coupled gauge theories anticipated to be of importance in the LHC era. It built upon the successful efforts of the SciDAC-1 project National Computational Infrastructure for Lattice Gauge Theory, in which a QCD Applications Programming Interface (QCD API) was developed that enables lat- tice gauge theorists to make effective use of a wide variety of massively parallel computers. In the SciDAC-2 project, optimized versions of the QCD API were being created for the IBM Blue- Gene/L (BG/L) and BlueGene/P (BG/P), the Cray XT3/XT4 and its successors, and clusters based on multi-core processors and Infiniband communications networks. The QCD API is being used to enhance the performance of the major QCD community codes and to create new applications. Software libraries of physics tools have been expanded to contain sharable building blocks for inclusion in application codes, performance analysis and visualization tools, and software for au- tomation of physics work flow. New software tools were designed for managing the large data sets generated in lattice QCD simulations, and for sharing them through the International Lattice Data Grid consortium. As part of the overall project, researchers at UNC were funded through ASCR to work in three general areas. The main thrust has been performance instrumentation and analysis in support of the SciDAC QCD code base as it evolved and as it moved to new computation platforms. In support of the performance activities, performance data was to be collected in a database for the purpose of broader analysis. Third, the UNC work was done at RENCI (Renaissance Computing Institute), which has extensive expertise and facilities for scientific data visualization, so we acted in an ongoing consulting and support role in that area.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum transport modelling of silicon nanobeams using heterogeneous computing scheme

We report the development of a powerful method for quantum transport calculations of nanowire/nanobeam structures with large cross sectional area. Our approach to quantum transport is based on Green's functions and tight-binding potentials. A linear algebraic formulation allows us to harness the massively parallel nature of Graphics Processing Units (GPUs) and our implementation is based on a heterogeneous parallel computing scheme with traditional processors and GPUs working together. Using our software tool, the electronic and quantum transport properties of silicon nanobeams with a realistic cross sectional area of ∼22.7 nm{sup 2} and a length of ∼81.5 nm—comprising 105 000 Si atoms and 24 000 passivating H atoms in the scattering region—are investigated. The method also allows us to perform significant averaging over impurity configurations—all possible configurations were considered in the case of single impurities. Finally, the effect of the position and number of vacancy defects on the transport properties was considered. It is found that the configurations with the vacancies lying closer to the local density of states (LDOS) maxima have lower transmission functions than the configurations with the vacancies located at LDOS minima or far away from LDOS maxima, suggesting both a qualitative method to tune or estimate optimal impurity configurations as well as a physical picture that accounts for device variability. Finally, we provide performance benchmarks for structures as large as ∼42.5 nm{sup 2} cross section and ∼81.5 nm length.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

Evaluating Ground Motion Predictions of USGS 3D Seismic Model of the San Francisco Bay Area with Broadband Seismograms

The USGS (Menlo Park) developed a three-dimensional (3D) geologic and seismic model of the greater San Francisco Bay Area for the purposes of computing earthquake ground motions. This model was used to compute scenario ground motions for the 1906 San Francisco, 1989 Loma Prieta and a suite of Hayward Fault earthquakes. While scenario ground motion calculations are important for investigating the amplitude, duration and variability of motions from large damaging earthquakes, the accuracy of such predictions depends on the accuracy of the 3D model. We evaluated the USGS 3D model of the Bay Area by computing predictions of broadband waveforms for 12 moderate (Mw 4-5) earthquakes and comparing them to the observed waveforms. Calculations were performed using WPP (an elastic finite difference code developed at LLNL) on massively parallel computers. Data were obtained from IRIS for Berkeley Digital Seismic Network (BDSN) and USArray broadband stations. The figure below shows a snapshot of the vertical component displacements for an earthquake near Glen Ellen (Sonoma County). Also shown is the comparison of the observed (blue) and computed (red) three-component seismograms at two stations: BKS (Berkeley) and JRSC (Stanford). Note that the motions at BKS are more complex and longer duration due to basin propagation effects from the San Pablo Bay, however the 3D model predicts this energy quite well. The motions at JRSC are simpler and the 3D model predicts the weaker late arriving energy on the transverse (T) component. This analysis found that the USGS 3D model could predict the amplitude, duration and waveform shapes of moderate earthquake ground motions quite well however we did find that phase delays reveal that shear velocities in the model were too fast. This information was used to revise the model for subsequent ground motion modeling.

58 GEOSCIENCES↗

Reducing uncertainty in personnel dosimetry calculations in the VHTR plant using MAVRIC

This work analyzes the efficacy of the MAVRIC sequence of the Scale 6.1 code package with respect to the accuracy of results and the ability to utilize large-memory, parallel machines. MAVRIC implements the hybrid FW-CADIS methodology to solve neutron and photon transport for shielding applications. Using the discrete ordinates method to solve the Boltzmann transport equation, an importance map is generated which MAVRIC then uses to bias a stochastic Monte Carlo simulation. The MAVRIC sequence is applied to generate neutron and photon dose rate distributions of improved accuracy in a model of a proposed VHTR power plant. Problems like this one, with a size on the order of magnitude of a nuclear power plant, require a prohibitive amount of memory to store complete importance maps. The issue is addressed by refining the mesh in areas around the source through the detector regions, while leaving a coarse mesh elsewhere. Additionally through the use of parallel computing, the angular flux can be expanded in higher quadrature sets, which leads to a better importance map while requiring no extra memory requirements during the Monte Carlo portion of the sequence. The final Monte Carlo simulations can be run concurrently on several machines with results combined after the fact, emulating parallelism that is not yet available in MAVRIC sequence. Using a combination of strategies, the MAVRIC sequence is shown to be able to scale across available computational resources, allowing the user to more quickly obtain Monte Carlo results with lower relative uncertainties in large, deep-penetration shielding problems. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗

Improved initial guess for minimum energy path calculations

A method is presented for generating a good initial guess of a transition path between given initial and final states of a system without evaluation of the energy. An objective function surface is constructed using an interpolation of pairwise distances at each discretization point along the path and the nudged elastic band method then used to find an optimal path on this image dependent pair potential (IDPP) surface. This provides an initial path for the more computationally intensive calculations of a minimum energy path on an energy surface obtained, for example, by ab initio or density functional theory. The optimal path on the IDPP surface is significantly closer to a minimum energy path than a linear interpolation of the Cartesian coordinates and, therefore, reduces the number of iterations needed to reach convergence and averts divergence in the electronic structure calculations when atoms are brought too close to each other in the initial path. The method is illustrated with three examples: (1) rotation of a methyl group in an ethane molecule, (2) an exchange of atoms in an island on a crystal surface, and (3) an exchange of two Si-atoms in amorphous silicon. In all three cases, the computational effort in finding the minimum energy path with DFT was reduced by a factor ranging from 50% to an order of magnitude by using an IDPP path as the initial path. The time required for parallel computations was reduced even more because of load imbalance when linear interpolation of Cartesian coordinates was used.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Experiences in extending parallware to support OpenACC. In: WACCPD '15 Proceedings of the Second Workshop on Accelerator Programming using Directives, Article No. 4

Porting scientific codes to accelerator-based computers using OpenACC and OpenMP is an important topic for the HPC community. Programmability, performance portability and developer productivity are key issues for the widespread use of these systems. In the scope of general-purpose parallel computing, Parallware is a new commercial OpenMP-enabling source-to-source compiler that automatically adds OpenMP capabilities in scientific programs. Thus, extending Parallware with OpenACC or OpenMP 4.x support would contribute to improve programmability and developer productivity. In contrast, the performance portability of such approach needs to be demonstrated in practice. This paper presents a preliminary study to extend Parallware with OpenACC support for GPU devices. A simple benchmark suite has been designed to mimic important features and computational patterns of real scientific applications. Handcoded OpenACC versions are compared to OpenMP versions automatically generated by Parallware. Performance is evaluated with the PGI OpenACC compiler on systems accelerated with NVIDIA GPUs.

Lobeiras, Jacobo↗

Mechanisms of interfacial reactivity in near surface and extreme environments

The local water structure surrounding ions in aqueous solutions greatly affects their chemical properties such as reaction rates, ion association, and proton and electron transport. These properties result in the behavior of ions in natural aqueous environments. For example ore transport is facilitated by chloride ion pair formation and the reaction of ions in an interface is strongly dependent on the dehydration of the ion hydration shell. We are developing the use of high-­resolution XAFS observations and 1st principles based MD-­XAFS analysis (spectra simulated using 1st principle methods with no adjustable parameters, AIMD) to interpret the solution properties of strongly interacting aqueous solutes under arbitrary pressure and temperature conditions. In the 1st principle MD-­XAFS method density functional theory (DFT) based MD simulations(Car and Parrinello, 1985) are used to generate a large ensemble of structural snap shots of the hydration region. These are then used to generate scattering intensities. I emphasize three points about this novel approach to analyzing XAFS data. 1st: As illustrated in Figure 1, the level of agreement between the calculated and observed intensities is considerably higher than has been obtained by any XAFS analysis to date (note 2nd shell region, R> 2 Å). 2nd: This result was obtained from a parameter free simulation with no fitting of the interaction potentials to any data. This supports the use of these methods for more difficult environments and more complex solutes (polyions). 3rd: New information about the shell structure (Figure 1) is now available because of this more detailed agreement. We note also that both multiple scattering and second shell features are well represented in the analysis. As far as we know this is the 1st analysis of second shell structure and multiple scattering. Excellent agreement has been obtained for most of the third row metal ions: Ca 2+ , Zn 2+ , Cu 2+ , Ni 2+ , Co 2+ , Mn 2+ , Fe 3+ , Cr 3+ . Calculations on these systems are demanding because of their open electronic shells, and high ionic charge. Principal Investigator: Professor John Weare (University of California, San Diego) The prediction of the interactions of geochemical fluids with minerals, nanoparticles, and colloids under extreme near surface conditions of temperature (T) and pressure (P) is a grand challenge research need in geosciences (U.S. DOE 2007, Basic Research Needs for Geosciences: Facilitating the 21st Energy Systems.). To evaluate the impact of these processes on energy production and management strategies it is necessary to have a high level of understanding of the interaction between complex natural fluids and mineral formations. This program emphasizes 1st principle parameter free simulations of complex chemical processes in solutions, in the mineral phase, and in the interfaces between these phases The development of new computational tools (with emphasis on oxide materials and reaction dynamics) tailored to treat wide range of conditions and time scales experienced in such geochemical applications is has been developed. Because of the sensitivity of the interaction in these systems to electronic structure and local bonding environments, and of the need to describe bond breaking/formation, our simulations are based on interactions calculated at the electronic structure level (ab-initio molecular dynamics, AIMD). The progress in the computational aspects of program may be summarized in terms of the following themes (objectives); Development of efficient parameter free dynamical simulation technology based on 1st principles force and energy calculations especially adapted for geochemical applications (e.g., mineral, interfaces and aqueous solutions) (continuing program); Calculation of the dynamics of water structure of in the surface-water interface of transition metal oxides and oxihydroxides; and Development of improved (beyond DFT+GGA) electronic structure calculations for minerals and the interface region that more accurately calculate electron correlation, spin density, and localization. The focus of the program is also on the iron oxide and oxihydroxide minerals and Fe 2+ (aq)/Fe 3+ (cr) oxidation in the mineral solution interface region. These methods included the development of model Hamilitonian methods that can be solved to near convergence for single site models (DMFT) and many-body perturbation methods (MP2, GW); Development of time decomposition methods to extend time scales of molecular dynamics (MD) simulations and support the use of high complexity electronic structure calculations (MP2, CCSD(T)) of forces for use in dynamical simulations where very high chemical accuracy is required (microsolvated reactions in absorbed surface layers); and The development of a new linear scaling finite element solver for eigenvalue problem that supports solution of quantum problems with unusual potential and boundary values. Application progress of the above new simulation technology to problems of geochemical interests includes; The prediction of metal oxide surface structure and the reduction/oxidation of Fe 3+ (cr)/Fe 2+ (aq) in metal oxide (hematite, goethite)/solution interfaces. Result: water interacts strongly with the 001 Hematite surface; interaction of water with the 100 goethite is weak; The study of ion solvation and the composition of ion hydration shells under extreme conditions (focus on Fe 3+/2+ , Al 3+ and Mg 2+ and their hydroxide speciation). Result: Ion association in water solutions can be calculated from 1st principle methods. Efficient sampling of the free energy requires more development; The continued development of new high resolution analysis of XAFS scattering of disordered systems (particularly Al, Mg) and of XANES calculations for aqueous ions. Result: EXAFS spectra can be calculated to high accuracy with DFT level dynamic simulations; The exploration of electron localization and electron transport in metal oxides (highly correlated materials). Result: Proper description of electron localization requires levels of calculation beyond DFT; and Localization of electrons in DFT type Hamiltonians was studied. Result: For very Dirac high exchange new solutions (New unphysical bifrucations) to the eigenvalue problem are found. The program was highly collaborative involving faculty and students in mathematics, physics and computer science departments as well as coworkers at the Pacific Northwest National Laboratories (PNNL). The students in this program had the opportunity to develop skills in the development of methods, the implementation of method on high performance parallel computers and the application of these methods to problem in geochemical science. Much of the software that was developed was incorporated in the NWchem software package maintained by PNNL.

58 GEOSCIENCES↗

Data-driven Fault Tolerance for Work Stealing Computations

Checkpoint-restart approaches to fault tolerance typically roll back all the processes to the previous checkpoint in the event of a failure. Work stealing is a promising technique to dynamically tolerate variations in the execution environment, including faults, system noise, and energy constraints. In this paper, we present fault tolerance mechanisms for task parallel computations, a popular computation idiom, employing work stealing. The computation is organized as a collection of tasks with data in a global address space. The completion of data operations, rather than the actual messages, is tracked to derive an idempotent data store. This information is used to accurately identify the tasks to be re-executed, therefore to recompute only the lost data, in the presence of random work stealing. We consider three recovery schemes that present distinct trade-offs -- lazy recovery with potentially increased re-execution cost, immediate collective recovery with associated synchronization overheads, and noncollective recovery enabled by additional communication. We employ distributed work stealing to dynamically rebalance the tasks on the live processes and evaluate the three schemes using candidate application benchmarks. We demonstrate that the overheads (space and time) of the fault tolerance mechanism are low, the cost incurred due to failures are small, and the overheads decrease with per-process work at scale.

fault tolerance, task parallelism, load balancing,↗

Determining Levels of Detail for Simulators of Parallel and Distributed Computing Systems via Automated Calibration

There are two sources of inaccuracy when simulating parallel and distributed computing systems: (i) a simulator implemented at an insufficient level of detail; and (ii) incorrectly calibrated simulation parameter values. Increasing the simulator’s level of detail can improve accuracy, but at the cost of higher space, time, and/or software complexity. Furthermore, evaluating the intrinsic accuracy of a simulator requires that its parameters be well-calibrated. Making decisions regarding the level of detail is thus challenging. We propose a methodology for instantiating the simulation calibration process and a framework for automating this process, which makes it possible to pick appropriate levels of detail for any simulator. We demonstrate the usefulness of our approach via two case studies for two different domains.

McDonald, Jessie [University of Hawaii at Manoa, H↗

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

Distribution Locational Real-Time Pricing Based Smart Building Control and Management

This paper proposes an real-virtual parallel computing scheme for smart building operations aiming at augmenting overall social welfare. The University of Denver's campus power grid and Ritchie fitness center is used for demonstrating the proposed approach. An artificial virtual system is built in parallel to the real physical system to evaluate the overall social cost of the building operation based on the social science based working productivity model, numerical experiment based building energy consumption model and the power system based real-time pricing mechanism. Through interactive feedback exchanged between the real and virtual system, enlarged social welfare, including monetary cost reduction and energy saving, as well as working productivity improvements, can be achieved.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed parallel messaging for multiprocessor systems

A method and apparatus for distributed parallel messaging in a parallel computing system. The apparatus includes, at each node of a multiprocessor network, multiple injection messaging engine units and reception messaging engine units, each implementing a DMA engine and each supporting both multiple packet injection into and multiple reception from a network, in parallel. The reception side of the messaging unit (MU) includes a switch interface enabling writing of data of a packet received from the network to the memory system. The transmission side of the messaging unit, includes switch interface for reading from the memory system when injecting packets into the network.

97 MATHEMATICS AND COMPUTING↗