Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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 379 records · Page 21

Performance of the OVERFLOW-MLP and LAURA-MLP CFD Codes on the NASA Ames 512 CPU Origin System

The shared memory Multi-Level Parallelism (MLP) technique, developed last year at NASA Ames has been very successful in dramatically improving the performance of important NASA CFD codes. This new and very simple parallel programming technique was first inserted into the OVERFLOW production CFD code in FY 1998. The OVERFLOW-MLP code's parallel performance scaled linearly to 256 CPUs on the NASA Ames 256 CPU Origin 2000 system (steger). Overall performance exceeded 20.1 GFLOP/s, or about 4.5x the performance of a dedicated 16 CPU C90 system. All of this was achieved without any major modification to the original vector based code. The OVERFLOW-MLP code is now in production on the inhouse Origin systems as well as being used offsite at commercial aerospace companies. Partially as a result of this work, NASA Ames has purchased a new 512 CPU Origin 2000 system to further test the limits of parallel performance for NASA codes of interest. This paper presents the performance obtained from the latest optimization efforts on this machine for the LAURA-MLP and OVERFLOW-MLP codes. The Langley Aerothermodynamics Upwind Relaxation Algorithm (LAURA) code is a key simulation tool in the development of the next generation shuttle, interplanetary reentry vehicles, and nearly all "X" plane development. This code sustains about 4-5 GFLOP/s on a dedicated 16 CPU C90. At this rate, expected workloads would require over 100 C90 CPU years of computing over the next few calendar years. It is not feasible to expect that this would be affordable or available to the user community. Dramatic performance gains on cheaper systems are needed. This code is expected to be perhaps the largest consumer of NASA Ames compute cycles per run in the coming year.The OVERFLOW CFD code is extensively used in the government and commercial aerospace communities to evaluate new aircraft designs. It is one of the largest consumers of NASA supercomputing cycles and large simulations of highly resolved full aircraft are routinely undertaken. Typical large problems might require 100s of Cray C90 CPU hours to complete. The dramatic performance gains with the 256 CPU steger system are exciting. Obtaining results in hours instead of months is revolutionizing the way in which aircraft manufacturers are looking at future aircraft simulation work. Figure 2 below is a current state of the art plot of OVERFLOW-MLP performance on the 512 CPU Lomax system. As can be seen, the chart indicates that OVERFLOW-MLP continues to scale linearly with CPU count up to 512 CPUs on a large 35 million point full aircraft RANS simulation. At this point performance is such that a fully converged simulation of 2500 time steps is completed in less than 2 hours of elapsed time. Further work over the next few weeks will improve the performance of this code even further.The LAURA code has been converted to the MLP format as well. This code is currently being optimized for the 512 CPU system. Performance statistics indicate that the goal of 100 GFLOP/s will be achieved by year's end. This amounts to 20x the 16 CPU C90 result and strongly demonstrates the viability of the new parallel systems rapidly solving very large simulations in a production environment.

Taft, James R.↗

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗

Many-Core Acceleration of a Discrete Ordinates Transport Mini-App at Extreme Scale, In: ISC High Performance 2016: High Performance Computing

Time-dependent deterministic discrete ordinates transport codes are an important class of application which provide significant challenges for large, many-core systems. One such challenge is the large memory capacity needed by the solve step, which requires us to have a scalable solution in order to have enough node-level memory to store all the data. In our previous work, we demonstrated the first implementation which showed a significant performance benefit for single node solves using GPUs. In this paper we extend our work to large problems and demonstrate the scalability of our solution on two Petascale GPU-based supercomputers: Titan at Oak Ridge and Piz Daint at CSCS. Our results show that our improved node-level parallelism scheme scales just as well across large systems as previous approaches when using the tried and tested KBA domain decomposition technique. We validate our results against an improved performance model which predicts the runtime of the main ‘sweep’ routine when running on different hardware, including CPUs or GPUs.

Computer Science↗

Robust Periodic Hartree-Fock Exchange for Large-Scale Simulations Using Gaussian Basis Sets

Hartree-Fock exchange with a truncated Coulomb operator has recently been discussed in the context of periodic plane-waves calculations [Spencer, J.; Alavi, A. Phys. Rev. B: SolidState, 2008, 77, 193110]. In this work, this approach is extended to Gaussian basis sets, leading to a stable and accurate procedure for evaluating Hartree-Fock exchange at the Γ-point. Furthermore, it has been found that standard hybrid functionals can be transformed into short-range functionals without loss of accuracy. The well-defined short-range nature of the truncated exchange operator can naturally be exploited in integral screening procedures and makes this approach interesting for both condensed phase and gas phase systems. The presented Hartree-Fock implementation is massively parallel and scales up to ten thousands of cores. This makes it feasible to perform highly accurate calculations on systems containing thousands of atoms or ten thousands of basis functions. The applicability of this scheme is demonstrated by calculating the cohesive energy of a LiH crystal close to the Hartree-Fock basis set limit and by performing an electronic structure calculation of a complete protein (rubredoxin) in solution with a large and flexible basis set.

Chemistry↗

Parallel Algorithms for Computing the Tensor-Train Decomposition

The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a d-dimension tensor in $\mathbb{R}$ $n\times∙∙∙$$\times$$n$ a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of $O(n^{[d/2]})$, improving upon $O(n^{d—1})$ from previous algorithms.

97 MATHEMATICS AND COMPUTING↗

Enabling parallel simulation of large-scale HPC network systems

Here, with the increasing complexity of today’s high-performance computing (HPC) architectures, simulation has become an indispensable tool for exploring the design space of HPC systems—in particular, networks. In order to make effective design decisions, simulations of these systems must possess the following properties: (1) have high accuracy and fidelity, (2) produce results in a timely manner, and (3) be able to analyze a broad range of network workloads. Most state-of-the-art HPC network simulation frameworks, however, are constrained in one or more of these areas. In this work, we present a simulation framework for modeling two important classes of networks used in today’s IBM and Cray supercomputers: torus and dragonfly networks. We use the Co-Design of Multi-layer Exascale Storage Architecture (CODES) simulation framework to simulate these network topologies at a flit-level detail using the Rensselaer Optimistic Simulation System (ROSS) for parallel discrete-event simulation. Our simulation framework meets all the requirements of a practical network simulation and can assist network designers in design space exploration. First, it uses validated and detailed flit-level network models to provide an accurate and high-fidelity network simulation. Second, instead of relying on serial time-stepped or traditional conservative discrete-event simulations that limit simulation scalability and efficiency, we use the optimistic event-scheduling capability of ROSS to achieve efficient and scalable HPC network simulations on today’s high-performance cluster systems. Third, our models give network designers a choice in simulating a broad range of network workloads, including HPC application workloads using detailed network traces, an ability that is rarely offered in parallel with high-fidelity network simulations

97 MATHEMATICS AND COMPUTING↗

Dilute Source CO 2 Capture: Management of Atmospheric Coal-Produced Legacy Emissions (Final Technical Report)

This report presents the scientific and technical findings by Carbon Engineering Ltd (CE) resulting from the DOE sponsored research and development project on Direct Air Capture (DAC) process. The work was performed by CE under the Award DE-FE0026861 from the US Department of Energy’s (DOE) National Energy Technology Laboratory (NETL). The work plan was centered on advancing the Recipient’s DAC technology, developing a better understanding of its performance and cost. The report outlines the results from two key activities that were performed under this award: Studying the performance characteristics of the DAC plant at both pilot and lab scale Techno-economic analysis (TEA) to study two implementations of CE’s proprietary DAC process: i) An early commercial DAC process that captures ~1 MT CO 2 /year of atmospheric CO 2 (Baseline case), and ii) A modified early commercial DAC process that captures 1 MT CO 2 /year of flue gas CO 2 downstream of a subcritical PC post-CCS power plant (Case 1 Option C). Within the first key activity of the project, significant operational improvements and learnings were realized, including for key equipment in the DAC process in addition to the overall system. Learnings included impact of equipment design on the capture, calcination and slaking processes, and operational parameter modifications for optimizing the pelletization process, along with the complex interactions and associated considerations of these on overall system performance. In parallel, benchtop scale equipment was successfully utilized to validate pilot scale data, such as, retention in the pellet reactor, and capture performance parameters of the air contactor. CE continues to conduct core research and development activities; the learnings from this DOE project will contribute to the design, testing and operation activities of CE’s fully integrated DAC validation plant, as well as the first commercial DAC plant. The second key activity incorporated the above learnings, as well as input from vendors and EPC experts, to produce the TEA report. More specifically, the TEA results were based on measured pilot plant performance data for all major unit operations, and on an energy and material balance for the process at commercial scale computed using an Aspen One® process simulation. The cost estimation methodology follows AACE International recommended practices; with an uncertainty range of -15%/+30%. Depending on financial assumptions, energy costs, and the specific choice of inputs and outputs, the levelized cost per ton CO 2 captured from the atmosphere for an early commercial plant for the baseline case ranges from 227 to 304 $/t-CO 2 . And, the levelized cost to capture 98% of the flue gas CO 2 emissions in a subcritical PC power plant (Case 1 Option C) through a combination of Cansolv carbon capture system and a modified DAC system was estimated to range from 109 to 160 $/MWh of net power generated. Process improvement opportunities identified during this work, in addition to cost reduction opportunities identified during the Value Engineering exercise associated with the Baseline case indicate that significant reductions in capital costs are available as CE scales up and proceeds through deployment of initial facilities.

20 FOSSIL-FUELED POWER PLANTS↗

Scalable Computation of Streamlines on Very Large Datasets

Understanding vector fields resulting from large scientific simulations is an important and often difficult task. Streamlines, curves that are tangential to a vector field at each point, are a powerful visualization method in this context. Application of streamline-based visualization to very large vector field data represents a significant challenge due to the non-local and data-dependent nature of streamline computation, and requires careful balancing of computational demands placed on I/O, memory, communication, and processors. In this paper we review two parallelization approaches based on established parallelization paradigms (static decomposition and on-demand loading) and present a novel hybrid algorithm for computing streamlines. Our algorithm is aimed at good scalability and performance across the widely varying computational characteristics of streamline-based problems. We perform performance and scalability studies of all three algorithms on a number of prototypical application problems and demonstrate that our hybrid scheme is able to perform well in different settings.

97 MATHEMATICS AND COMPUTING↗

Physics Mining of Multi-Source Data Sets

Powerful new parallel data mining algorithms can produce diagnostic and prognostic numerical models and analyses from observational data. These techniques yield higher-resolution measures than ever before of environmental parameters by fusing synoptic imagery and time-series measurements. These techniques are general and relevant to observational data, including raster, vector, and scalar, and can be applied in all Earth- and environmental science domains. Because they can be highly automated and are parallel, they scale to large spatial domains and are well suited to change and gap detection. This makes it possible to analyze spatial and temporal gaps in information, and facilitates within-mission replanning to optimize the allocation of observational resources. The basis of the innovation is the extension of a recently developed set of algorithms packaged into MineTool to multi-variate time-series data. MineTool is unique in that it automates the various steps of the data mining process, thus making it amenable to autonomous analysis of large data sets. Unlike techniques such as Artificial Neural Nets, which yield a blackbox solution, MineTool's outcome is always an analytical model in parametric form that expresses the output in terms of the input variables. This has the advantage that the derived equation can then be used to gain insight into the physical relevance and relative importance of the parameters and coefficients in the model. This is referred to as physics-mining of data. The capabilities of MineTool are extended to include both supervised and unsupervised algorithms, handle multi-type data sets, and parallelize it.

Helly, John↗

Performing k eff Validation of As-Loaded Criticality Safety Calculations Using UNF-ST&DARDS: Sensitivity Calculations

The general method for performing validation of as loaded criticality safety calculations using UNF ST&DARDS is presented in a paper by Clarity, which includes a description of the UNF-ST&DARDS system. Proof-of-principle analyses were performed in the summer of 2019 for MPC-32 dual purpose canisters (DPCs) containing pressurized water reactor (PWR) fuel assemblies. Summaries of these results are presented in this and a companion paper for this conference. The current paper describes the TSUNAMI-3D calculations performed to generate sensitivity data, and the companion paper discusses the selection of critical experiments applicable for validation of the 11 MPC-32 DPCs considered. The generation of sensitivity data for as-loaded spent nuclear fuel (SNF) DPCs is a challenge given the detailed model of the fuel compositions generated by UNF ST&DARDS. Each fuel assembly is modeled with its own irradiation history in 18 axial nodes, unless the fuel assembly is damaged and thus considered as fresh by design basis. This results in a set of 576 fuel compositions, each of which must be processed separately in a multigroup (MG) calculation. Therefore, a continuous-energy (CE) TSUNAMI-3D method was chosen to alleviate this challenge. Two CE TSUNAMI-3D methods are available in SCALE 6.2.3: the iterated fission probability (IFP) and contribution-linked eigenvalue sensitivity/uncertainty estimation via track-length importance characterization (CLUTCH). Since the IFP method is not feasible because of memory requirements associated with its implementation in SCALE, the CLUTCH method was selected for these calculations. CLUTCH has been implemented in SCALE in parallel, allowing long calculations to be performed in reasonable timeframes. The two primary user inputs necessary for CLUTCH calculations are the F*(r) mesh and the number of latent generations used in determining the F*(r) function. This F*(r) function is used as the importance function for fission chains originating in a given volume element (voxel), and it is calculated using the IFP method in the skipped generations. A large number of skipped generations is thus required to ensure accurate calculation of this importance function. In these calculations, 500 generations were used to calculate the F*(r) function. For more information regarding the calculation of F*(r), see Jones [4]. The remainder of this paper is focused on the selection of the F*(r) mesh and the number of latent generations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Contention Modeling for Multithreaded Distributed Shared Memory Machines: The Cray XMT

Distributed Shared Memory (DSM) machines are a wide class of multi-processor computing systems where a large virtually-shared address space is mapped on a network of physically distributed memories. High memory latency and network contention are two of the main factors that limit performance scaling of such architectures. Modern high-performance computing DSM systems have evolved toward exploitation of massive hardware multi-threading and fine-grained memory hashing to tolerate irregular latencies, avoid network hot-spots and enable high scaling. In order to model the performance of such large-scale machines, parallel simulation has been proved to be a promising approach to achieve good accuracy in reasonable times. One of the most critical factors in solving the simulation speed-accuracy trade-off is network modeling. The Cray XMT is a massively multi-threaded supercomputing architecture that belongs to the DSM class, since it implements a globally-shared address space abstraction on top of a physically distributed memory substrate. In this paper, we discuss the development of a contention-aware network model intended to be integrated in a full-system XMT simulator. We start by measuring the effects of network contention in a 128-processor XMT machine and then investigate the trade-off that exists between simulation accuracy and speed, by comparing three network models which operate at different levels of accuracy. The comparison and model validation is performed by executing a string-matching algorithm on the full-system simulator and on the XMT, using three datasets that generate noticeably different contention patterns.

99 GENERAL AND MISCELLANEOUS↗

Fast Parallel Stochastic Subspace Algorithms for Large-Scale Ambient Oscillation Monitoring

With the installation of synchrophasors widely across the power grid, measurement-based oscillation monitoring algorithms are becoming increasingly useful in identifying the real-time oscillatory modal properties in power systems. When the number of phasor measurement unit (PMU) channels grows, the computational time of many PMU data based algorithms is dominated by the computational burden in processing large-scale dense matrices. In order to overcome this limitation, this paper presents new formulations and computational strategies for speeding up an ambient oscillation monitoring algorithm, namely, stochastic subspace identification (SSI). Based on previous work, two fast singular value decomposition (SVD) approaches are first applied to the SVD evaluation within the SSI algorithm. Next, block structures are exploited so that the large-scale dense matrix computations can be processed in parallel. This helps in memory savings as well as in overall computational time. Experimental results from three sets of archived data of the western interconnection demonstrate that the new approaches can provide significant speedups while retaining modal estimation accuracy. With proposed fast parallel algorithms, the real-time oscillation monitoring of the large-scale system using hundreds of PMU measurements becomes feasible.

97 MATHEMATICS AND COMPUTING↗

Multigroup Monte Carlo on GPUs: Comparison of history- and event-based algorithms

This article presents an investigation of the performance of different multigroup Monte Carlo transport algorithms on GPUs with a discussion of both history-based and event-based approaches. Several algorithmic improvements are introduced for both approaches. By modifying the history-based algorithm that is traditionally favored in CPU-based MC codes to occasionally filter out dead particles to reduce thread divergence, performance exceeds that of either the pure history-based or event-based approaches. The impacts of several algorithmic choices are discussed, including performance studies on Kepler and Pascal generation NVIDIA GPUs for fixed source and eigenvalue calculations. Single-device performance equivalent to 20–40 CPU cores on the K40 GPU and 60–80 CPU cores on the P100 GPU is achieved. Last, in addition, nearly perfect multi-device parallel weak scaling is demonstrated on more than 16,000 nodes of the Titan supercomputer.

97 MATHEMATICS AND COMPUTING↗

Nuclide Depletion Capabilities in the Shift Monte Carlo Code

A new depletion capability has been developed in the Exnihilo radiation transport code suite. This capability enables massively parallel domain-decomposed coupling between the Shift continuous-energy Monte Carlo solver and the nuclide depletion solvers in ORIGEN to perform high-performance Monte Carlo depletion calculations. This paper describes this new depletion capability and discusses its various features, including a multi-level parallel decomposition, high-order transport-depletion coupling, and energy-integrated power renormalization. Several test problems are presented to validate the new capability against other Monte Carlo depletion codes, and the parallel performance of the new capability is analyzed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

OpenRBC: A Fast Simulator of Red Blood Cells at Protein Resolution

We present OpenRBC, a coarse-grained molecular dynamics code, which is capable of performing an unprecedented in silico experiment—simulating an entire mammal red blood cell lipid bilayer and cytoskeleton as modeled by multiple millions of mesoscopic particles—using a single shared memory commodity workstation. To achieve this, we invented an adaptive spatial-searching algorithm to accelerate the computation of short-range pairwise interactions in an extremely sparse three-dimensional space. The algorithm is based on a Voronoi partitioning of the point cloud of coarse-grained particles, and is continuously updated over the course of the simulation. The algorithm enables the construction of the key spatial searching data structure in our code, i.e., a lattice-free cell list, with a time and space cost linearly proportional to the number of particles in the system. The position and the shape of the cells also adapt automatically to the local density and curvature. The code implements OpenMP parallelization and scales to hundreds of hardware threads. It outperforms a legacy simulator by almost an order of magnitude in time-to-solution and >40 times in problem size, thus providing, to our knowledge, a new platform for probing the biomechanics of red blood cells.

Biophysics↗

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗

Acceleration of the Particle Swarm Optimization for Peierls–Nabarro modeling of dislocations in conventional and high-entropy alloys

Dislocations are among the most important defects in determining the mechanical properties of both conventional alloys and high-entropy alloys. The Peierls-Nabarro model supplies an efficient pathway to their geometries and mobility. The difficulty in solving the integro-differential Peierls-Nabarro equation is how to effectively avoid the local minima in the energy landscape of a dislocation core. Among the other methods to optimize the dislocation core structures, we choose the algorithm of Particle Swarm Optimization, an algorithm that simulates the social behaviors of organisms. By employing more particles (bigger swarm) and more iterative steps (allowing them to explore for longer time), the local minima can be effectively avoided. But this would require more computational cost. The advantage of this algorithm is that it is readily parallelized in modern high computing architecture. We demonstrate the performance of our parallelized algorithm scales linearly with the number of employed cores.

36 MATERIALS SCIENCE↗

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗