Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Performance”

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 469 records · Page 26

In-Situ Feature Extraction of Large Scale Combustion Simulations Using Segmented Merge Trees, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

The ever increasing amount of data generated by scientific simulations coupled with system I/O constraints are fueling a need for in-situ analysis techniques. Of particular interest are approaches that produce reduced data representations while maintaining the ability to redefine, extract, and study features in a post-process to obtain scientific insights. This paper presents two variants of in-situ feature extraction techniques using segmented merge trees, which encode a wide range of threshold based features. The first approach is a fast, low communication cost technique that generates an exact solution but has limited scalability. The second is a scalable, local approximation that nevertheless is guaranteed to correctly extract all features up to a predefined size. We demonstrate both variants using some of the largest combustion simulations available on leadership class supercomputers. Our approach allows state-of-the-art, feature-based analysis to be performed in-situ at significantly higher frequency than currently possible and with negligible impact on the overall simulation runtime.

Computer Science↗

Pandemic drugs at pandemic speed: infrastructure for accelerating COVID-19 drug discovery with hybrid machine learning- and physics-based simulations on high-performance computers

The race to meet the challenges of the global pandemic has served as a reminder that the existing drug discovery process is expensive, inefficient and slow. There is a major bottleneck screening the vast number of potential small molecules to shortlist lead compounds for antiviral drug development. New opportunities to accelerate drug discovery lie at the interface between machine learning methods, in this case, developed for linear accelerators, and physics-based methods. The two in silico methods, each have their own advantages and limitations which, interestingly, complement each other. Here, we present an innovative infrastructural development that combines both approaches to accelerate drug discovery. The scale of the potential resulting workflow is such that it is dependent on supercomputing to achieve extremely high throughput. We have demonstrated the viability of this workflow for the study of inhibitors for four COVID-19 target proteins and our ability to perform the required large-scale calculations to identify lead antiviral compounds through repurposing on a variety of supercomputers.

97 MATHEMATICS AND COMPUTING↗

Inference-Optimized AI and High Performance Computing for Gravitational Wave Detection at Scale

We introduce an ensemble of artificial intelligence models for gravitational wave detection that we trained in the Summit supercomputer using 32 nodes, equivalent to 192 NVIDIA V100 GPUs, within 2 h. Once fully trained, we optimized these models for accelerated inference using NVIDIA TensorRT. We deployed our inference-optimized AI ensemble in the ThetaGPU supercomputer at Argonne Leadership Computer Facility to conduct distributed inference. Using the entire ThetaGPU supercomputer, consisting of 20 nodes each of which has 8 NVIDIA A100 Tensor Core GPUs and 2 AMD Rome CPUs, our NVIDIA TensorRT-optimized AI ensemble processed an entire month of advanced LIGO data (including Hanford and Livingston data streams) within 50 s. Our inference-optimized AI ensemble retains the same sensitivity of traditional AI models, namely, it identifies all known binary black hole mergers previously identified in this advanced LIGO dataset and reports no misclassifications, while also providing a 3X inference speedup compared to traditional artificial intelligence models. We used time slides to quantify the performance of our AI ensemble to process up to 5 years worth of advanced LIGO data. In this synthetically enhanced dataset, our AI ensemble reports an average of one misclassification for every month of searched advanced LIGO data. We also present the receiver operating characteristic curve of our AI ensemble using this 5 year long advanced LIGO dataset. This approach provides the required tools to conduct accelerated, AI-driven gravitational wave detection at scale.

97 MATHEMATICS AND COMPUTING↗

Accelerating Battery Simulations by Using High Performance Computing and Opportunities with Machine Learning

The US Department of Energy (DOE) estimates that the battery pack cost of $60 per kilowatt-hour while increasing the driving range to over 300 miles and vehicle charging under 15 min or less would enable mass penetration of electric vehicles in the USA by 2030. These projections are based on the currently available high-density cell chemistry combined with a system level design and optimized electrodes. Electrodes for current state-of-the-art lithium-ion cell technology are fabricated from electrode slurry comprising of active material, polymeric binder, and conductive diluent such as carbon black that are coated on metal current collectors such as copper and aluminum. Given these challenging requirements for development of electrical energy storage devices for future transportation needs, a predictive simulation capability which can accelerate design by considering performance and safety implications of different geometry, materials, and chemistry choices is required. In this chapter, we discuss our state-of-the-art three-dimensional modeling framework, providing examples on battery performance and safety simulations. We also present approaches to use machine learning in the context of large datasets that are becoming available.

Allu, Srikanth↗

A Review of Lightweight Thread Approaches for High Performance Computing

High-level, directive-based solutions are becoming the programming models (PMs) of the multi/many-core architectures. Several solutions relying on operating system (OS) threads perfectly work with a moderate number of cores. However, exascale systems will spawn hundreds of thousands of threads in order to exploit their massive parallel architectures and thus conventional OS threads are too heavy for that purpose. Several lightweight thread (LWT) libraries have recently appeared offering lighter mechanisms to tackle massive concurrency. In order to examine the suitability of LWTs in high-level runtimes, we develop a set of microbenchmarks consisting of commonlyfound patterns in current parallel codes. Moreover, we study the semantics offered by some LWT libraries in order to expose the similarities between different LWT application programming interfaces. This study reveals that a reduced set of LWT functions can be sufficient to cover the common parallel code patterns and that those LWT libraries perform better than OS threads-based solutions in cases where task and nested parallelism are becoming more popular with new architectures.

Castello, Adrian↗

Dynamic State Estimation Utilizing High Performance Computing Methods

The state estimation tools which are currently deployed in power system control rooms are based on a quasi-steady-state assumption. As a result, the suite of operational tools that rely on state estimation results as inputs do not have dynamic information available and their accuracy is compromised. This paper presents an overview of the Kalman Filtering process and then focuses on the implementation of the predication component on multiple processors.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Lamellar: A Rust-based Asynchronous Tasking and PGAS Runtime for High Performance Computing

Cybersecurity is one of the largest concerns in modern computing, impacting and dictating how governments, private corporations, and individuals interact with and live in an increasingly digital world. The NSA has recently released a memo [ 1] on “Software Memory Safety” where they highlight that both Microsoft and Google have stated around 70% of software vulnerabilities were due to memory safety issues. Although languages such as C and C++ provide freedom and flexibility with memory management, guaran- teeing safety falls mostly on the developer. The NSA recommends using “memory safe” languages whenever possible. In this paper we introduce Lamellar, an asynchronous tasking and PGAS HPC runtime written in Rust, one such "memory safe" language. We describe the entire Lamellar stack, from network interfaces to high- level abstractions such as distributed LamellarArrays and Active Messages. We conclude by showing comparable performance to legacy PGAS runtimes (e.g. OpenSHMEM) on a subset of the BALE kernel suite while maintaining strong memory safety principles.

HPC Software Systems, Rust Programming Language, P↗

High Performance Computing to Quantify the Evolution of Microscopic Concentration Gradients During Flash Processing

During the Flash process, the cross section of a plain-carbon or a low-alloy steel is austenitized through rapid heating and transformed on rapid cooling to a predominantly martensite + bainite structure with small amounts of retained austenite. Unlike conventional heat treating, homogeneity is intentionally avoided during Flash processing of steels. The Flash process assembly consists of a pair of rolls that transfer the steel sheets through the heating and cooling stage of the thermal cycle. The initial microstructure of the steel consists of ferrite (body-centered cubic iron) + carbide ((Fe,X)mCn) mixture. The heating rate through the peak temperature is a function of temperature and reaches a peak of about 300-400°C/s and the cooling rate has a maximum value of 3,000-4,000°C/s. The on-heating phase transformations include carbide dissolution, austenite (face-centered cubic iron) nucleation and growth, and diffusion of carbon and other substitutional elements in the steel. The on-cooling phase transformations include formation of martensite (body-centered tetragonal phase containing supersaturated solute) and bainite (ferrite plates with or without fine carbides). In this project, the focus is on Fe-C-Cr steels that are currently Flash processed for armor applications. The modeling effort proposed here will help optimize the Flash thermal cycle for these low alloy steels to achieve the target performance, which is an ongoing effort at SFP Works. A significant feature of Flash processed Fe-C-Cr steels is the presence of scatter in the through-thickness in the sheet. The variability in hardness results from a variability in the bainite + martensite microstructure that is sensitive to the local chemical concentration of C and Cr. Such a chemical inhomogeneity is intentionally obtained in the Flash process. Although such a microstructural gradient is presumably responsible for the exceptional properties of the Flash processed steel, it is very important to quantify the gradients as a function of Flash variabilities in processing parameters and the input microstructure. Understanding the mechanistic pathway that leads to microstructural gradients could be ground-breaking and instrumental for achieving better process control and optimized microstructural state to meet application-specific strength-ductility requirements. Since the final microstructure depends on setting up precise solute concentration gradients through a rapid heating process, and transforming these regions into various phases, it is important to understand how small changes in steel chemistry, input microstructure (carbide size and distribution), and process variables (Flash thermal cycle) will impact the solute concentration gradients.

97 MATHEMATICS AND COMPUTING↗

Measured and computed performance of a microstrip filter composed of semi-insulating GaAs on a fused quartz substrate

The performance of a microstrip hammerhead filter that has been fabricated on an electrically thin layer of semiinsulating GaAs backed by a fused quartz substrate was measured and compared to results of a three-dimensional finite-difference time-domain (FD-TD) program used to calculate the response of the filter both with and without the GaAs layer. The program, presented by Sheen et al. (1990), discretizes the entire structure and then simulates the propagation of a Gaussian pulse through the filter. The microstrip filter is intended for applications involving ultrathin lifted-off or etched-back GaAs containing both active devices and passive microstrip circuitry backed by a much thicker mechanically rigid low-loss, low-dielectric-constant substrate. The low-pass characteristics of the hammerhead filter with the intermediate GaAs layer are compared with those of the same filter on quartz alone. Both the measured and computed data show a significant shift in cutoff frequency (about 10 percent at the 3 dB points) for a GaAs layer that is 0.007 wavelengths thick at 4 GHz.

Siegel, Peter H.↗

Designing a Scalable Fault Tolerance Model for High Performance Computational Chemistry: A Case Study with Coupled Cluster Perturbative Triples

In the last couple of decades, the massive computational power provided by the most modern supercomputers has resulted in simulation of higher order computational chem- istry methods, previously considered intractable. As the system sizes continue to increase, computational chemistry domain continues to escalate this trend using parallel comput- ing with programming models such as Message Passing Interface (MPI) and Partitioned Global Address Space (PGAS) programming models such as Global Arrays. The ever increasing scale of these supercomputers comes at a cost of reduced mean time between failures, currently in the order of days, and projected to be in the order of hours for up- coming extreme scale systems. While traditional disk based checkpointing methods are ubiquitous for storing intermediate solutions, they suffer from high overhead of writing and recovering from checkpoints. In practice, checkpointing itself often brings the system down. Clearly, methods beyond checkpointing are imperative to handling the aggravating issue of reducing MTBF. In this paper, we address this challenge by designing and im- plementing an efficient fault tolerant version of coupled cluster method with NWChem, using in memory data redundancy. We present the challenges associated with our de- sign including efficient data storage model, maintenance of at least one consistent data copy and the recovery process. Our performance evaluation without faults shows that the current design exhibits negligible overhead. In the presence of a fault, the proposed design incurs negligible overhead in comparison to the state of the art implementation without faults.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Field-Scale Model for the Natural Attenuation of Uranium at the Hanford 300 Area using High Performance Computing

Three-dimensional reactive flow and transport simulations are carried out to better understand the persistence of uranium [U(VI)] at the Hanford 300 Area bordering the Columbia River. The massively parallel code PFLOTRAN developed under a DOE SciDAC-2 project is employed in the simulations. A new conceptual model is presented for understanding present-day and future attenuation rates of U(VI) at the 300 Area site. Unique to the conceptual model is the recognition of three distinct phases in the evolution of the site corresponding to: (I) initial emplacement of waste; (II) present-day conditions of slow leaching of U(VI) from the Hanford sediments; and (III) the complete removal of non-labile U(VI) from the source region. This work focuses on Phase II. Both labile and non-labile forms of U(VI) are included in the model as sorbed and mineralized forms of U(VI), respectively. The non-labile form plays an important role in providing a long-term source of U(VI) as it slowly leaches out of the Hanford sediment. Rapid fluctuations in the Columbia River stage on hourly, weekly and seasonal time scales are found to play a major role in determining the migration behavior of U(VI). The calculations demonstrate that U(VI) is released into the Columbia River at a highly fluctuating rate in a ratchet-like behavior with nonzero U(VI) flux occurring only during flow from contaminated sediment into the river. The cumulative flux, however, is found to increase approximately linearly with time. The flow rate and U(VI) flux into the Columbia River predicted by the model is highly sensitive to the value used in the conductance boundary condition at the river-sediment interface. By fitting the conductance to the observed piezometric head at well 399-2-1, good agreement was obtained for both the mean flux of water and U(VI) at the river-aquifer boundary. It was found that a multirate sorption model developed to account for long tails observed in U(VI) breakthrough curves obtained from column experiments with contaminated Hanford sediments, gave similar results for Phase II as an equilibrium surface complexation model for the discharge rate of U(VI) into the Columbia River.

54 ENVIRONMENTAL SCIENCES↗

VinaMPI: Facilitating multiple receptor high-throughput virtual docking on high-performance computers

The program VinaMPI has been developed to enable massively large virtual drug screens on leadership-class computing resources, using a large number of cores to decrease the time-to-completion of the screen. VinaMPI is a massively parallel Message Passing Interface (MPI) program based on the multithreaded virtual docking program AutodockVina, and is used to distribute tasks while multithreading is used to speed-up individual docking tasks. VinaMPI uses a distribution scheme in which tasks are evenly distributed to the workers based on the complexity of each task, as defined by the number of rotatable bonds in each chemical compound investigated. VinaMPI efficiently handles multiple proteins in a ligand screen, allowing for high-throughput inverse docking that presents new opportunities for improving the efficiency of the drug discovery pipeline. VinaMPI successfully ran on 84,672 cores with a continual decrease in job completion time with increasing core count. The ratio of the number of tasks in a screening to the number of workers should be at least around 100 in order to have a good load balance and an optimal job completion time. The code is freely available and downloadable. Lastly, the instructions for downloading and using the code are provided in the Supporting Information.

97 MATHEMATICS AND COMPUTING↗

COMET: A Domain-Specific Compilation of High-Performance Computational Chemistry

The computational power increases over the past decades have greatly enhanced the ability to simulate chemical reactions and understand ever more complex transformations. Tensor contractions are the fundamental computational building block of these simulations. These simulations have often been tied to one platform and restricted in generality by the interface provided to the user. The expanding prevalence of accelerators and researcher demands necessitate a more general approach which is not tied to specific hardware or requires contortion of algorithms to specific hardware platforms. In this paper we present COMET, a domain-specific programming language and compiler infrastructure for tensor contractions targeting heterogeneous accelerators. We present a system of progressive lowering through multiple layers of abstraction and optimization that achieves up to 1.98×speedup for 30 tensor contractions commonly used in computational chemistry and beyond.

Mutlu, Erdal↗

Application of High Performance Computing for Simulating the Unstable Dynamics of Dilute Spark-Ignited Combustion

In collaboration with a major automotive manufacturer, we are using computational simulations of in-cylinder combustion to understand the multi-scale nonlinear physics of the dilute stability limit. Because some key features of dilute combustion can take thousands of successive cycles to develop, the computation time involved in using complex models to simulate these effects has limited industrys ability to exploit simulations in optimizing advanced engines. We describe a novel approach for utilizing parallel computations to reveal long-timescale features of dilute combustion without the need to simulate many successive engine cycles in series. Our approach relies on carefully guided, concurrent, single-cycle simulations to create metamodels that preserve the long-timescale features of interest. We use a simplified combustion model to develop and demonstrate our strategy for adaptively guiding the concurrent simulations to generate metamodels. We next will implement this strategy with higher-fidelity, multi-scale combustion models on large computing facilities to generate more refined metamodels. The refined metamodels can then be used to accelerate engine development because of their efficiency. Similar approaches might also be used for rapidly exploring the dynamics of other complex multi-scale systems that evolve with serial dependency on time.

Finney, Charles↗

Supercomputing Centers and Electricity Service Providers: A Geographically Distributed Perspective on Demand Management in Europe and the United States, In: ISC High Performance 2016: High Performance Computing

Supercomputing Centers (SCs) have high and variable power demands, which increase the challenges of the Electricity Service Providers (ESPs) with regards to efficient electricity distribution and reliable grid operation. High penetration of renewable energy generation further exacerbates this problem. In order to develop a symbiotic relationship between the SCs and their ESPs and to support effective power management at all levels, it is critical to understand and analyze how the existing relationships were formed and how these are expected to evolve.

Computer Science↗