xRAGE: A Brief Overview [Slides]
This report provides information about xRAGE, "a multidimensional, multimaterial, massively parallel, Eulerian AMR, multiphysics code." Challenges and future possibilities for xRAGE are also discussed.
SEARCH · Search NASA
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.
This report provides information about xRAGE, "a multidimensional, multimaterial, massively parallel, Eulerian AMR, multiphysics code." Challenges and future possibilities for xRAGE are also discussed.
Unlike transmission systems, distribution systems do not typically contain sufficient metering to enable real-time state estimation. The lack of sufficient real-time measurements prohibits accurate and timely monitoring of the state of distribution systems. As a result, control and optimal operation of distribution systems, especially those containing large numbers of renewable generation units are not possible without proper data and information about the current state of the system. The main motivation of this project is to address this shortcoming by developing an approach which provides “predicted” real-time measurements so that they can be used to execute a distribution system state estimator. Thus, the objective of the project is to make the distribution systems fully observable, such that the hosting capacity for solar generation can be accurately estimated, and unnecessary solar curtailments can be avoided. In order to accomplish this goal, the project investigated the use of a grid-model-informed machine learning (ML) tool which integrates heterogeneous data streams obtained from AMI meters, SCADA as well as PMU measurements and created synchronous measurement snapshots for the state estimator (SE); and developed a hybrid robust SE which provides not only accurate state estimates but also real-time feedback for the ML model refinement.
Explore the source record for details and available documents.
Nuclear criticality experiments are effective at informing the performance of nuclear data libraries across many applications. This work explores the implications of refining critical experiment MCNP models from their low fidelity optimization phase to penultimate neutronic models. Specifically, this work is focused on two series of plutonium fueled experiments funded through internal programs at Los Alamos National Laboratory building off previous efforts under the EUCLID (Experiments Underpinned by Computational Learning for Improvements in Nuclear Data) collaboration. Thales, the first of the two collaborations, is a fast spectrum Ta-reflected plutonium experiment to support operations at PF-4. The second experiment are twin configurations designed to target the intermediate energy cross sections in 239 Pu. Motivation for this experiment stems from the PARallel Approach of Differential and InteGral Measurements (PARADIGM) collaboration which hopes to achieve a significant reduction in 239 Pu cross section uncertainties in the intermediate region.
Synthetic nanopores were recently demonstrated with memristive and nonlinear voltage-current behaviors, akin to ion channels in a cell membrane. Such ionic devices are considered a promising candidate for the development of brain-inspired neuromorphic computing techniques. In this work, we show the composite behavior of nanopore-array large memristors, formed with different membrane materials, pore sizes, electrolytes, and device arrangements. Anodic aluminum oxide (AAO) membranes with 5 nm and 20 nm diameter pores and track-etched polycarbonate (PCTE) membranes with 10 nm diameter pores are tested and shown to demonstrate memristive and nonlinear behaviors with approximately 107–1010 pores in parallel when electrolyte concentration across the membranes is asymmetric. Ion diffusion through the large number of channels induces time-dependent electrolyte asymmetry that drives the system through different memristive states. The behaviors of series composite memristors with different configurations are also presented. In addition to helping understand fluidic devices and circuits for neuromorphic computing, the results also shed light on the development of field-assisted ion-selection-membrane filtration techniques as well as the investigations of large neurons and giant synapses. Further work is needed to de-embed parasitic components of the measurement setup to obtain intrinsic large memristor properties.
Faced with physical and energy density limitations on clock speed, contemporary microprocessor designers have increasingly turned to on-chip parallelism for performance gains. Algorithms should accordingly be designed with ample amounts of fine-grained parallelism if they are to realize the full performance of the hardware. This requirement can be challenging for algorithms that are naturally expressed as a sequence of small-matrix operations, such as the Kalman filter methods widely in use in high-energy physics experiments. In the High-Luminosity Large Hadron Collider (HL-LHC), for example, one of the dominant computational problems is expected to be finding and fitting charged-particle tracks during event reconstruction; today, the most common track-finding methods are those based on the Kalman filter. Experience at the LHC, both in the trigger and offline, has shown that these methods are robust and provide high physics performance. Previously we reported the significant parallel speedups that resulted from our efforts to adapt Kalman-filter-based tracking to many-core architectures such as Intel Xeon Phi. Here we report on how effectively those techniques can be applied to more realistic detector configurations and event complexity.
More attention has been given to the computational cost associated with the fitting of an emulator. Substantially less attention is given to the computational cost of using that emulator for prediction. This is primarily because the cost of fitting an emulator is usually far greater than that of obtaining a single prediction, and predictions can often be obtained in parallel. In many settings, especially those requiring Markov Chain Monte Carlo, predictions may arrive sequentially and parallelization is not possible. In this case, using an emulator procedure which can produce accurate predictions efficiently can lead to substantial time savings in practice. In this paper, we propose a global model approximate Gaussian process framework via extension of a popular local approximate Gaussian process (laGP) framework. Our proposed emulator can be viewed as a treed Gaussian process where the leaf nodes are laGP models, and the tree structure is learned greedily as a function of the prediction stream. The suggested method (called leapGP) has interpretable tuning parameters which control the time‐memory trade‐off. One reasonable choice of settings leads to an emulator with a training cost and makes predictions rapidly with an asymptotic amortized cost of .
Performing analysis or generating visualizations concurrently with high performance simulations can yield great benefits compared to post-processing data. Writing and reading large volumes of data can be reduced or eliminated, thereby producing an I/O cost savings. One such method for concurrent simulation and analysis is in transit - streaming data from the resource running the simulation to a separate resource running the analysis. In transit analysis can be beneficial since computational resources may not have certain resources needed for visualization and analysis (e.g. GPUs) and to reduce the impact of performing analysis tasks to the run time of the simulation. When sending and receiving data in transit, data redistribution mechanisms are needed in order to support heterogeneous data layouts that may be required by the simulation and analysis applications. The work described in this paper compares two mechanisms for on-the-fly data redistribution when streaming data in parallel between two distributed memory applications. Finally, our results show that it is often more advantageous to stream data in the same layout as the sender and redistribute data amongst processes on the receiving end than to stream data in the final layout needed by the receiver.
This report describes how electrical utilities with residential, industrial, commercial and government customers make decisions using Data Analytics (DA) applications and discusses how OpenFMB was leveraged to share that data among disparate types of devices for DA. OpenFMB is a data standard developed by utilities for distributed communication and control of power system assets. Here we explored how OpenFMB can be used for sharing analytics and what those analytics could be for a set of representative grid devices. A review of DA applications performed by electrical utilities and customers is presented. An overview of how the testbed we used was built and configured is summarized. Several experiments which were carried out to explore the capabilities of OpenFMB alongside other data sharing mechanisms for gathering sensor measurements and sharing analytics is also discussed. And finally a comparison of OpenFMB and LBNL’s SPARK framework is summarized. Today’s electrical utilities focus on monitoring the real-time customer consumptions, offering new real-time tariff models based on customer usage habits (rewards and punishments), providing energy peak during peak load times (plan energy generation and distribution), improving the load management for transformers and power lines, and controlling the energy and grid resources efficiently. On the other hand, the DA applications for residential customers are based on modifying the customer electricity usage habit to save money, making accurate and timely decisions for electrical billing. However, the DA applications for industrial, commercial and government customers focus on creating efficient programs to improve the environmental condition (reducing CO₂ emission), developing better load forecasting for industrial and/or commercial activities. In this project, a testbed was built to explore how the OpenFMB framework can be used to distribute data among various types of representative grid edge devices. Micro PMUs (Phasor Measurement Unit) were used to collect and transmit data to an OpenPDC server alongside relays with a framework configured with a system using OpenFMB to collect and transmit data. The testbed was composed of a physical asset based on a 60 Hz AC radial power system constructed using SI-GRID components. The power system consisted of a 3-phase 14 volts line-to-ground (24 volts line-to-line) power source, three 3-phase line emulators, a programmable resistive load bank, two smart relays, two micro PMUs, and a (SCADA) and Phasor Data Concentrator (PDC) computer. This testbed configuration allowed us to perform breaker operation tests collecting data from the micro PMUs and from the relays’ sensors. During the micro PMU breaker operation tests we collected the measured and estimated fundamental voltages, currents, frequency as well as the total true, reactive and apparent power. The displacement power factor from two micro PMUs located in parallel power lines was also used. The software steps for the implementation of the Synchrophasor system are explained in detail in this report. The setting (1-2-3) and data collection (4-5) phases were performed with a free download open source software. In the setting phase, the micro PMUs were set (1), the data stream for each micro PMU was validated, and the connection and configuration files were created (2). The PDC computer was set using the connection and configuration files of the micro PMUs (3). In the data collection phase, the binary data from the micro PMUs was collected (4), and the binary data files of the micro PMUs was converted to analyze the test results (5). OpenFMB was configured to use protocol translators to read Modbus and transform the reading into the OpenFMB data model to be read for DA applications.Our experiments showed that by leveraging the OpenFMB data model and the micro PMUs together we could obtain better situational awareness of network faults, which in some cases could lead to failures in the system and would be less perceivable otherwise. For example, in one experiment the fundamental RMS current angle, and the fundamental displacement power factor (estimated by the ratio between the measured real and apparent total power) had a disturbance at the micro PMU connected to the beginning of the parallel power line because the breaker was opened without the operators or SCADA system’s knowledge, and no current was available. Based on the breaker state scenarios and micro PMU locations, the DA applications using the current angle and displacement power factor from the micro PMUs should be studied in detail to avoid a non-desired measurement that could affect the decision from the DA. Also, the sample rates for PMU, Relay and micro PMU devices were compared. The DA application improved the control and operation between the electrical utilities and their customers (residential, industrial, transportation, commercial and government). The higher the sample rate, the better the quality of the measurement for DA estimations.
In order to treat the multiple time scales of ocean dynamics in an efficient manner, the baroclinic-barotropic splitting technique has been widely used for solving the primitive equations for ocean modeling. Based on the framework of strong stability-preserving Runge-Kutta approach, we propose two high-order multirate explicit time-stepping schemes (SSPRK2-SE and SSPRK3-SE) for the resulting split system in this paper. The proposed schemes allow for a large time step to be used for the three-dimensional baroclinic (slow) mode and a small time step for the two-dimensional barotropic (fast) mode, in which each of the two mode solves just need to satisfy their respective CFL conditions for numerical stability. Specifically, at each time step, the baroclinic velocity is first computed by advancing the baroclinic mode and fluid thickness of the system with the large time-step and the assistance of some intermediate approximations of the barotropicmode obtained by substepping with the small time step; then the barotropic velocity is corrected by using the small time step to re-advance the barotropic mode un-der an improved barotropic forcing produced by interpolation of the forcing terms from the preceding baroclinic mode solves; lastly, the fluid thickness is updated by coupling the baroclinic and barotropic velocities. Additionally, numerical inconsistencies on the discretized sea surface height caused by the mode splitting are relieved via a reconciliation process with carefully calculated flux deficits. Here, two benchmark tests from the “MPAS-Ocean” platform are carried out to numerically demonstrate the performance and parallel scalability of the proposed SSPRK-SE schemes.
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.
Mammalian genomes contain millions of regulatory elements that control the complex patterns of gene expression. Previously, the ENCODE consortium mapped biochemical signals across hundreds of cell types and tissues and integrated these data to develop a registry containing 0.9 million human and 300,000 mouse candidate cis-regulatory elements (cCREs) annotated with potential functions. Here we have expanded the registry to include 2.37 million human and 967,000 mouse cCREs, leveraging new ENCODE datasets and enhanced computational methods. This expanded registry covers hundreds of unique cell and tissue types, providing a comprehensive understanding of gene regulation. Functional characterization data from assays such as STARR-seq, massively parallel reporter assay, CRISPR perturbation and transgenic mouse assays have profiled more than 90% of human cCREs, revealing complex regulatory functions. We identified thousands of novel silencer cCREs and demonstrated their dual enhancer and silencer roles in different cellular contexts. Integrating the registry with other ENCODE annotations facilitates genetic variation interpretation and trait-associated gene identification, exemplified by the identification of KLF1 as a novel causal gene for red blood cell traits. This expanded registry is a valuable resource for studying the regulatory genome and its impact on health and disease.
FastCaloSim is a parameterized simulation of the particle energy response and of the energy distribution in the ATLAS calorimeter. It is a relatively small and self-contained package with massive inherent parallelism and captures the essence of GPU offloading via important operations like data transfer, memory initialization, floating point operations, and reduction. It was identified by the High Energy Physics Center for Computational Excellence project as a good testbed for evaluating the performance and ease of portability of programming models. In this paper, we will discuss the results of our evaluation of the porting process to Kokkos, SYCL, Alpaka, OpenMP and std::par (nvc++), and compare performance on NVIDIA, AMD and Intel GPUs, as well as multicore CPUs.
The high-order finite difference real-space pseudopotential density functional theory (DFT) approach is a valuable method for large-scale, massively parallel DFT calculations. A significant challenge in the approach is the oscillating “egg-box” error introduced by aliasing associated with a coarse grid spacing. To address this issue while minimizing computational cost, we developed a finite difference interpolation (FDI) scheme [Roller et al., J. Chem. Theory Comput. 19, 3889 (2023)] as a means of exploiting the high resolution of the pseudopotential to reduce egg-box effects systematically. Here, we show an implementation of this method in the PARSEC code and examine the practical utility of the combination of FDI with additional methods for improving force precision and/or reducing its computational cost, including orbital-based forces, compensating charges (namely, adding and subtracting a judiciously chosen charge density such that the total density is unaltered), and a modified spatial domain in which the real-space grid is defined. Using selected small molecules, as well as metallic Li, as test cases, we show that a combination of all four aspects leads to a significant reduction in computational cost while retaining a high level of precision that supports accurate structures and vibrational spectra, as well as stable and accurate molecular dynamics runs.
We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large practical quantum circuits by providing resource estimates for the ground state estimation of molecules. Finally, we find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.
This package is developed as a backend for multi-layer and multi-time domain controller. One example are controller based on [Model Predictive Control] (MPC) where different modules with different time constants have to be coordinated to allow optimal control. In a simple example, the Weather Forecast must be acquired and processed, the MPC is computed, and finally the control is applied. All these modules typically run on the same time step (Time step: 5 minutes), but are different instances within the framework. The framework allows parallelization using the `multiprocessing` module. However, another real-time controller (Time step: 1 second) must be applied to react on instant system disturbances beyond the MPC time step. Last, a supervisory MPC controller (Time step: 1 hour) might be added to ensure global optimality.
Viskores is a scientific visualization library that is the primary deployment of such algorithms to the parallel accelerated processors of modern DOE supercomputers. In this paper, we review the capabilities provided by Viskores and how these capabilities are leveraged by other software in the high-performance computing ecosystem. We discuss the Viskores data representation and pay particular attention to array management. Through this array management we describe how data is adapted between Viskores and other software along with strategies for converting dynamic, polymorphic objects to static representations better suited to GPU processing. We conclude with several examples of Viskores integrating with high-performance software that is used in production today.
The Department of Energy’s (DOE’s) National Energy Technology Laboratory’s (NETL’s) Blowout and Spill Occurrence Model (BLOSOM), and the National Oceanic and Atmospheric Administration’s (NOAA’s) General NOAA Operational Modeling Environment (GNOME) are compared. Increasingly complex simulations are used to assess similarities and differences between the two models’ components. The simulations presented here are forced by ocean currents from a Finite Volume Community Ocean Model (FVCOM) implementation that has excellent skill in representing tidal motion, and with observed wind data that compensates for a coarse vertical ocean model resolution. The comprehensive comparison between GNOME and BLOSOM presented here, should aid modelers in interpreting their results. Beyond many similarities, aspects where both models are distinct are highlighted. Some suggestions for improvement are included, e.g., the inclusion of temporal interpolation of the forcing fields (BLOSOM) or the inclusion of a deflection angle option when parameterizing wind-driven processes (GNOME). Overall, GNOME and BLOSOM perform similarly, and are found to be complementary oil spill models. This paper also sheds light on what drove the historical Point Wells spill, and serves the additional purpose of being a learning resource for those interested in oil spill modeling. The increasingly complex approach used for the comparison is also used, in parallel, to illustrate the approach an oil spill modeler would typically follow when trying to hindcast or forecast an oil spill, including detailed technical information on basic aspects, like choosing a computational time step. We discuss our successful hindcast of the 2003 Point Wells oil spill that, to our knowledge, had remained unexplained. The oil spill models’ solutions are compared to the historical Point Wells’ oil trajectory, in time and space, as determined from overflight information. Our hindcast broadly replicates the correct locations at the correct times, using accurate tide and wind forcing. While the choice of wind coefficient we use is unconventional, a simplified analytic model supported by observations, suggests that it is justified under this study’s circumstances. We highlight some of the key oceanographic findings as they may relate to other oil spills, and to the regional oceanography of the Salish Sea, including recommendations for future studies.