Search NASA⌕ Search

SEARCH · Search NASA

Results for “Programming Model”

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 397 records · Page 22

Distributed Load Restoration in Unbalanced Active Distribution Systems

We present that the resilience of modern power systems has been constantly threatened by various natural disasters and manmade attacks. Under those threats, fast and automatic restoration actions are critical for restoring impacted systems to normal operating conditions and preventing from additional disastrous consequences. Smart grid technologies, such as distributed energy resources (DERs) and microgrids, provide both opportunities and challenges for distribution system restoration. In this paper, distributed load restoration (DLR), in unbalanced active distribution networks is developed using the alternating direction method of multipliers (ADMM) algorithm. The step-by-step restoration actions are provided to schedule the output of DERs and distribution system control devices, as well as the power consumption from transmission system restoration. The nonlinearities from three-phase unbalanced power flow and distribution components modeling are relaxed into a convex quadratic programming model. Then, the problem is decomposed into subproblems for each node by applying ADMM-DLR; and solves through each agent by exchanging limited information with neighboring nodes in an iterative procedure. The developed models and algorithms are validated and demonstrated through testing of the IEEE 13-node and 123-node test feeders. Lastly, simulation results demonstrate the effectiveness of restoring unbalanced distribution system with the hybrid bottom-up and top-down restoration strategies.

14 SOLAR ENERGY↗

Cooperative Server Clustering for a Scalable GAS Model on petascale cray XT5 Systems

Global Address Space (GAS) programming models are attractive because they retain the easy-to-use addressing model that is the characteristic of shared-memory style load and store operations. The scalability of GAS models depends directly on the design and implementation of runtime libraries on the targeted platforms. In this paper, we examine the memory requirement of a popular GAS runtime library, Aggregate Remote Memory Copy Interface (ARMCI) on petascale Cray XT 5 systems. Then we describe a new technique cooperative server clustering that enhances the memory scalability of ARMCI communication servers. In cooperative server clustering, ARMCI servers are organized into clusters, and cooperatively process incoming communication requests among them. A request intervention scheme is also designed to expedite the return of responses to the initiating processes. Our experimental results demonstrate that, with very little impact on ARMCI communication latency and bandwidth, cooperative server clustering is able to significantly reduce the memory requirement of ARMCI communication servers, thereby enabling highly scalable scientific applications. In particular, it dramatically reduces the total execution time of a scientific application, NWChem, by 45% on 2400 processes.

99 GENERAL AND MISCELLANEOUS↗

Cooperative Server Clustering for a Scalable GAS Model on Petascale Cray XT5 Systems

Global Address Space (GAS) programming models are attractive because they retain the easy-to-use addressing model that is the characteristic of shared-memory style load and store operations. The scalability of GAS models depends directly on the design and implementation of runtime libraries on the targeted platforms. In this paper, we examine the memory requirement of a popular GAS run-time library, Aggregate Remote Memory Copy Interface (ARMCI) on petascale Cray XT 5 systems. Then we describe a new technique, cooperative server clustering, that enhances the memory scalability of ARMCI communication servers. In cooperative server clustering, ARMCI servers are organized into clusters, and cooperatively process incoming communication requests among them. A request intervention scheme is also designed to expedite the return of responses to the initiating processes. Our experimental results demonstrate that, with very little impact on ARMCI communication latency and bandwidth, cooperative server clustering is able to significantly reduce the memory requirement of ARMCI communication servers, thereby enabling highly scalable scientific applications. In particular, it dramatically reduces the total execution time of a scientific application, NWChem, by 45% on 2400 processes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Graph Algorithms in PGAS: Chapel and UPC++

The Partitioned Global Address Space (PGAS) programming model can be implemented «««< HEAD either with programming language features or with runtime library APIs, each implementation favoring different aspects (e.g., productivity, abstraction, flexibility, or performance). Certain language and runtime features, such as collectives, explicit and asynchronous communication primitives, and constructs facilitating overlap of communication and computation (such as futures and conjoined futures) can enable better performance and scaling for irregular applications, in particular for distributed graph analytics. We compare graph algorithms in one of each of these environments: the Chapel PGAS programming language and the UPC++ PGAS runtime library. We implement algorithms for breadth-first search and triangle counting graph kernels in both environments. We discuss the code in each of the environments, and compile performance data on a Cray Aries and an Infiniband platform. Our results show that the library-based approach of UPC++ currently provides strong performance while Chapel provides a high-level abstraction that, harder to optimize, still provides comparable performance. We argue that various language primitives and runtime library features should be considered in conjunction with each other to design future graph analytics libraries so as to incorporate the best of both worlds.

Distributed Algorithms, Graph algorithms, HPC↗

Delivering Science on Day One

While benchmarking software is useful for testing the performance limits and stability of Argonne National Laboratory’s new Theta supercomputer, there is no substitute for running real applications to explore the system’s potential. The Argonne Leadership Computing Facility’s Theta Early Science Program, modeled after its highly successful code migration program for the Mira supercomputer, has one primary aim: to deliver science on day one. Here is a closer look at the type of science problems that will be getting early access to Theta, a next-generation machine being rolled out this year.

Williams, Timothy J.↗

Building research capacity in Southern Appalachian mountain wetlands

This project increased research capacity in Southern Appalachian wetlands by facilitating new collaborations between the PI (UNC Asheville) and DOE and academic research partners. Mountain wetlands are among the rarest natural communities in the Southern Appalachians; most of the sites contain rare or endangered species and have been incorporated into or are being considered for the new Mountain Bogs National Wildlife Refuge (established in 2015). PI Wilcox’s research since 2010 has focused on wetland hydrology at over a dozen priority field sites in western North Carolina, eastern Tennessee, and northern Georgia. This project provided time and funding to learn about DOE programs and resources, including meteorological data, watershed modeling programs, analytical capabilities, and computing facilities. PI Wilcox was able to meet potential research partners at professional conferences and the DOE-BER-ESS PI meeting and invite several of those potential partners to visit UNC Asheville and nearby field sites in Western North Carolina. These connections have resulted in three new collaborative research proposals, and a new cooperative agreement with the US Fish and Wildlife Service that includes two new field sites.

54 ENVIRONMENTAL SCIENCES↗

Dispatch Optimization, System Design and Cost Benefit Analysis of a Nuclear Reactor with Molten Salt Thermal Storage

Variable renewable energy availability has increased the volatility in energy prices in most markets. Nuclear power plants, with a large ratio of capital to variable costs, have historically operated as base load energy suppliers but the need for more flexible operation is increasing. We simulate the techno-economic performance of a 950 MWt nuclear power plant, based on the Westinghouse lead-cooled fast reactor, coupled with molten salt thermal storage as a method for flexible energy dispatch. We use the System Advisor Model to model the nuclear reactor thermal power input and power cycle operating modes. We combine this robust engineering model with a mixed-integer linear program model for optimized dispatch scheduling. We then simulate the coupled nuclear and thermal storage system under different market scenarios with varying price volatility. We find that the coupled plant outperforms the base plant under markets where energy price peaks fluctuate by a factor of two or more about the mean price. We show that a calculated power purchase agreement price for the plant improves by up to 10% when operating under California energy market conditions. Sensitivity analysis on the thermal storage cost shows that the optimal design remains unchanged even when doubling costs.

25 ENERGY STORAGE↗

Research Highlight - Dispatch Optimization, System Design and Cost Benefit Analysis of a Nuclear Reactor with Molten Salt Thermal Storage

We highlight our work from our previous publication titled "Dispatch Optimization, System Design, and Cost Benefit Analysis of a Nuclear Reactor with Molten Salt Thermal Storage" published in MDPI Energies 2022 (doi.org/10.3390/en15103599). Variable renewable energy availability has increased the volatility in energy prices in most markets. Nuclear power plants, with a large ratio of capital to variable costs, have historically operated as base load energy suppliers but the need for more flexible operation is increasing. We simulate the techno-economic performance of a 950 MWt nuclear power plant, based on the Westinghouse lead-cooled fast reactor, coupled with molten salt thermal storage as a method for flexible energy dispatch. We use the System Advisor Model to model the nuclear reactor thermal power input and power cycle operating modes. We combine this robust engineering model with a mixed-integer linear program model for optimized dispatch scheduling. We then simulate the coupled nuclear and thermal storage system under different market scenarios with varying price volatility. We find that the coupled plant outperforms the base plant under markets where energy price peaks fluctuate by a factor of two or more about the mean price. We show that a calculated power purchase agreement price for the plant improves by up to 10% when operating under California energy market conditions. Sensitivity analysis on the thermal storage cost shows that the optimal design remains unchanged even when doubling costs.

97 MATHEMATICS AND COMPUTING↗

Global Arrays

Global Arrays (GA) is a distributed-memory programming model that allows for shared-memory-style programming combined with one-sided communication, to create a set of tools that combine high performance with ease-of-use. GA exposes a relatively straightforward programming abstraction, while supporting fully-distributed data structures, locality of reference, and high-performance communication. GA was originally formulated in the early 1990’s to provide a communication layer for the Northwest Chemistry (NWChem) suite of chemistry modeling codes that was being developed concurrently.

global arrays↗

Simulated execution of hybrid quantum computing systems

We use modeling and simulation to study the behavior and performance of hybrid quantum computing systems. Our approach is based on a layered design with abstract machine models, which identify the key components and interfaces for quantum processing units, quantum programming models, and hybrid execution models. We use discrete-event simulating to track the dynamical state of hierarchical abstract machine models while executing test programs, and we collect statistics on time and energy consumption to forecast the resources required by quantum processors for future scientific computation.

Humble, Travis↗

Improving Ligand Geometry in Protein Data Bank Structures Computationally

Information about the three‐dimensional structures of complex biological molecules is an indispensable research tool for many fields of study, including biology, chemistry, pharmacology, and computer science. The Protein Data Bank (PDB) is an public digital archive providing access to structures of nucleic acids, proteins, and large macromolecular machines determined experimentally by X‐ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, and 3‐dimensional electron microscopy (3DEM). PDB structures undergo validation for structural plausibility upon their deposition into the PDB using the program Mogul, which cross references each deposited structure against similar data in the Cambridge Structural Database (CSD). Ligands associated with PDB structures are a common source of structural inaccuracy. In this study, a programmatic pipeline was developed to determine if ligand geometric accuracy could be improved using known computational tools. Ligands with dubious geometry were identified through a Python mining code. A sample set of the identified structures was remodeled into minimum energy conformations using the molecular dynamics program AMBER and then fit to the original experimental density maps using the molecular modeling program Coot. The refined models were compared to the original models in the PDB as well as to similar structures in the CSD using the deposition statistical validation server. Preliminary results suggest that the pipeline effectively identifies and improves ligand structures that possess inaccurate geometry. This method can be used to evaluate and improve the accuracy of specific ligands in structures both archived and pending deposition. Support or Funding Information This work was supported by an NSF REU and the RCSB PDB [NSF (DBI‐1338415), NIH, and DOE.] This abstract is from the Experimental Biology 2019 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Miller, Beck↗

The Uranium from Seawater Program at the Pacific Northwest National Laboratory: Overview of Marine Testing, Adsorbent Characterization, Adsorbent Durability, Adsorbent Toxicity, and Deployment Studies

The Pacific Northwest National Laboratory’s (PNNL) Marine Science Laboratory (MSL) located along the coast of Washington State is evaluating the performance of uranium adsorption materials being developed for seawater extraction under realistic marine conditions with natural seawater. Two types of exposure systems were employed in this program: flow-through columns for testing of fixed beds of individual fibers and pellets and a recirculating water flume for testing of braided adsorbent material. Testing consists of measurements of the adsorption of uranium and other elements from seawater as a function of time, typically 42 to 56 day exposures, to determine the adsorbent capacity and adsorption rate (kinetics). Analysis of uranium and other trace elements collected by the adsorbents was conducted following strong acid digestion of the adsorbent with 50% aqua regia using either Inductively Coupled Plasma Optical Emission Spectrometry (ICP-OES) or Inductively Coupled Plasma Mass Spectrometer (ICP-MS). The ORNL 38H adsorbent had a 56 day adsorption capacity of 3.30 ± 0.68 g U/ kg adsorbent (normalized to a salinity of 35 psu), a saturation adsorption capacity of 4.89 ± 0.83 g U/kg of adsorbent material (normalized to a salinity of 35 psu) and a half-saturation time of 28 ± 10 days. The AF1 adsorbent material had a 56 day adsorption capacity of 3.9 ± 0.2 g U/kg adsorbent material (normalized to a salinity of 35 psu), a saturation capacity of 5.4 ± 0.2 g U/kg adsorbent material (normalized to a salinity of 35 psu) and a half saturation time of 23 ± 2 days. The ORNL amidoxime-based adsorbent materials are not specific for uranium, but also adsorb other elements from seawater. The major doubly charged cations in seawater (Ca and Mg) account for a majority of the cations adsorbed (61% by mass and 74% by molar percent). For the ORNL AF1 adsorbent material, U is the 4th most abundant element adsorbed by mass and 7th most abundant by molar percentage

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Locality-Aware Scheduling for Scalable Heterogeneous Environments

Heterogeneous computing promise boost performance of scientific applications by allowing massively parallel execution of computational tasks. However, manually managing extremely heterogeneous, multi-device systems is complicated and may result in sub-optimal performance. Specifically, data management is an extremely challenging problem on multi-device systems. In this work, we introduce two locality-aware schedulers for the Minos Computing Library (MCL), an asynchronous, task-based programming model and runtime for extremely heterogeneous systems. The first scheduler implements a pure locality-aware algorithm to maximize data reuse, though it might incur in ”hot-spots” that limit system utilization. The second scheduler mitigates this drawback by dynamically targeting between locality-awareness and system utilization based on the current workload and available computing devices. Our results show that locality-awareness greatly benefit applications that exhibit data reuse, providing up to 6.9x and 7.9x over the original MCL scheduler and equivalent OpenCL implementations, respectively. Moreover, our schedulers introduce negligible overhead compared with the original MCL scheduler and achieve similar performance for applications that don’t benefit from data locality.

Architecture, co-design, Task-based programming mo↗

An interval-parameter stochastic robust optimization model for supporting municipal solid waste management under uncertainty

A stochastic robust interval linear programming model (IPRO) was developed for supporting municipal solid waste management under uncertainty. The model improves upon the existing stochastic robust optimization (SRO) and interval linear programming (ILP) methods by allowing evaluations of trade-offs among expected costs, cost variability, and risk of violating relax constraints simultaneously, as well as reflections of complex uncertainties through both interval and stochastic theories. A long-term waste management problem was used to demonstrate the applicability of IPRO model. The results indicated that IPRO normally led to interval solutions, where waste-management alternatives could be generated by adjusting the decision-variable values within their intervals. The model could also help waste managers to identify desired policies that under various environmental, economic, system-feasibility and system-reliability constraints.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Pair distribution function analysis of discrete nanomaterials in PDFgui

Pair distribution functions (PDFs) are a leading tool for atomic structure analysis of nanomaterials. However, the most widely used programs for refining atomic structure against PDF data are based on extended crystallographic models, which cannot be applied to discrete, whole nanoparticles. Furthermore, this work describes a straightforward approach to simulate and refine atomistic models of discrete clusters and nanoparticles employing widely used PDF modelling programs such as PDFgui that utilize extended crystallographic models. In this approach, the whole particle to be modelled is contained within an expanded, and otherwise empty, unit cell that is sufficiently large to avoid correlations between atoms in neighbouring unit cells over the r range analyzed. The PDF of the particle is simulated as a composite using two conventional `phases': one that calculates the atom–atom correlations and one that approximates the local number density. This approach is first validated for large nanoparticles that are well modelled by a conventional shape factor model, and then applied to simulate the PDF of discrete particles and low-dimensional materials (graphene and MXene) and to model the experimental PDF data for single-layer FeS nanosheets. A comparison of this approach with the DiffPy-CMI program, which calculates the PDF of discrete species, shows that the composite modelling approach is equally or more accurate. Example input files for implementing this approach within PDFgui and TOPAS, and recommendations for selecting model parameters for reliable application of this refinement strategy, are provided.

36 MATERIALS SCIENCE↗

Adapting Wave-front Algorithms to Efficiently Utilize Systems with Deep Communication Hierarchies

Large-scale systems increasingly exhibit a differential between intra-chip and inter-chip communication performance especially in hybrid systems using accelerators. Processorcores on the same socket are able to communicate at lower latencies, and with higher bandwidths, than cores on different sockets either within the same node or between nodes. A key challenge is to efficiently use this communication hierarchy and hence optimize performance. We consider here the class of applications that contains wavefront processing. In these applications data can only be processed after their upstream neighbors have been processed. Similar dependencies result between processors in which communication is required to pass boundary data downstream and whose cost is typically impacted by the slowest communication channel in use. In this work we develop a novel hierarchical wave-front approach that reduces the use of slower communications in the hierarchy but at the cost of additional steps in the parallel computation and higher use of on-chip communications. This tradeoff is explored using a performance model. An implementation using the Reverse-acceleration programming model on the petascale Roadrunner system demonstrates a 27% performance improvement at full system-scale on a kernel application. The approach is generally applicable to large-scale multi-core and accelerated systems where a differential in system communication performance exists.

43 PARTICLE ACCELERATORS↗

Toward Automated Detection of Portability Bugs in Kokkos Parallel Programs

Performance-portable programming frameworks provide abstractions for parallel execution to allow easily porting an application to multiple backend programming models, such as CUDA, HIP, and OpenMP. However, programs may still have portability bugs that manifest only on specific backends. Traditional testing is ineffective in discovering these bugs, as it would require concrete execution on all supported hardware configurations for a potentially infinite set of inputs. To mitigate this issue, we focused on a specific programming framework, Kokkos, and identified several categories of common portability bugs. We then developed Klokkos, a static analysis approach based on symbolic execution that can run on commodity hardware, before execution on supercomputers. As a proof-of-concept, we ran Klokkos on examples encoding the identified bugs. Our results show that Klokkos is effective, efficient, and precise: it detected all the considered bugs, quickly, and without any false positives. Although preliminary, our results motivate further research and development in this direction.

Kale, Vivek↗

What do we mean by the word “Shock”?

From one vantage point, a shock is a continuous but drastic change in state variables that occurs over very small time and length scales. These scales and associated changes in state variables can be measured experimentally. From another vantage point, a shock is a mathematical singularity consisting of instantaneous changes in state variables. This more mathematical view gives rise to analytical solutions to idealized problems. And from a third vantage point, a shock is a structure in a hydrocode prediction. Its width depends on the simulation’s grid resolution and artificial viscosity. These three vantage points can be in conflict when ideas from the associated fields are combined, and yet combining them is an important goal of an integrated modeling program. This presentation explores an example of how models for real materials in the presence of real shocks react to a hydrocode’s numerical shocks of finite width. The presentation will include an introduction to plasticity for the novice, an historical view of plasticity algorithms, a demonstration of how pursuing the meaning of “shock” has resulted in hydrocode improvements, and will conclude by answering some of the questions that arise from that pursuit. After the technical part of the presentation, a few slides advertising LANL’s Computational Physics Student Summer Workshop will be shown.

36 MATERIALS SCIENCE↗