Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

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↗

Toward a MILP Modeling Framework for Distribution System Restoration

Large-scale blackouts and extreme weather events in recent decades raise the concern for improving the resilience of electric power infrastructures. Distribution service restoration (DSR), a fundamental application in outage management systems, allows restoration solutions for system operators when power outages happen. As distribution generators (DGs) and remotely controllable devices are increasingly installed in distribution systems, an advanced DSR framework is critical to perform optimally coordinated restoration that can achieve maximal restoration performance. This work introduces a DSR modeling framework, which can generate optimal switching sequences and estimated time of restoration in the presence of remotely controllable switches, manually operated switches, and dispatchable DGs. Two mathematical models, a variable time step model and a fixed time step model, are presented and compared. The proposed models are formulated as a mixed-integer linear programming model, and their effectiveness is evaluated via the IEEE 123 node test feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SST-GPU: An Execution -Driven CUDA Kernel Scheduler and Streaming-Multiprocessor Compute Model

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of massive amounts of data have created a space for massively parallel acceleration where the context for thousands of concurrent threads are resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. The design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. To address the need for a scalable, decentralized GPU model that can model large GPUs, chiplet-based GPUs and multi-node GPUs, this report details the first steps in integrating the open-source, execution driven GPGPU-Sim into the SST framework. The first stage of this project, creates two elements: a kernel scheduler SST element accepts work from SST CPU models and schedules it to an SM-collection element that performs cycle-by-cycle timing using SSTs Mem Hierarchy to model a flexible memory system.

97 MATHEMATICS AND COMPUTING↗

Optimizing equity in energy policy interventions: A quantitative decision-support framework for energy justice

This paper presents a quantitative framework to support policy decision-making around equitable energy interventions. By combining sociodemographic and techno-economic models in the energy space, we propose a linear programming model to calculate the optimal portfolio of energy investments that explicitly minimizes the energy burden of a given population of energy insecure households. The model is formulated as a multi-objective optimization suitable to support the decisions on weatherization and deployment of distributed energy resources. We illustrate our methodology with a case study involving a population of 14,043 energy insecure households in Wayne County, Detroit, United States.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Toward a Synthetic Model for Distribution System Restoration and Crew Dispatch

Distribution service restoration (DSR) is critical for improving the resilience and reliability of modern distribution systems by strategically and sequentially energizing the system components and customer loads. Restoring electricity service to affected customers also requires multiple crews with different skill sets to perform multiple tasks that are procedurally interdependent with safety guaranteed. However, in existing DSR practices, switch operations and crew dispatch are scheduled separately, and their interdependence is not fully considered. As advanced technologies are enabling remote communication, control, and dispatch, utilities now desire an integrated DSR framework to achieve seamless coordination among multiple DSR tasks such as switch operation, crew dispatch, and component repair. In this paper, we introduce a synthetic model that integrates the service restoration model and the crew dispatch model based on a universal routing model. The proposed model can provide the estimated time of restoration for each load, the switching sequence for safely operating remotely/manually operated switches, and dispatch solutions for crews with different skill sets. The proposed synthetic model is formulated as a mixed-integer linear programming model, and its effectiveness is evaluated via the IEEE 123 bus test feeder and several large-scale test feeders (EPRI Ckt5, Ckt7, Ckt24, and IEEE 8500 node test feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Persistent heap Management library

PERM is a C library for persistent heap management and is intended for use with a dynamic-memory allocator (e.g. malloc, free). The PERM memory allocator replaces the standard C dynamic memory allocation functions with compatible versions that provide persistent memory to application programs. Memory allocated with the PERM allocatory will persist between program invocations after a call to a checkpoint function. This function essentially saves the state of the heap and registered global variables to a file which may reside in flash memory or other node local storage. A few other functions are also provided by the library to manage checkpoint files. Global variables in an application can be marked persistent and be included in a checkpoint by using a compiler attribute defined as PERM. The PERM checkpoint methof is not dependent on the programming model ans works with distributed memory or shared memory programs.

Source record↗

Persistent heap Management library

PERM is a C library for persistent heap management and is intended for use with a dynamic-memory allocator (e.g. malloc, free). The PERM memory allocator replaces the standard C dynamic memory allocation functions with compatible versions that provide persistent memory to application programs. Memory allocated with the PERM allocatory will persist between program invocations after a call to a checkpoint function. This function essentially saves the state of the heap and registered global variables to a file which may reside in flash memory or other node local storage. A few other functions are also provided by the library to manage checkpoint files. Global variables in an application can be marked persistent and be included in a checkpoint by using a compiler attribute defined as PERM. The PERM checkpoint methof is not dependent on the programming model ans works with distributed memory or shared memory programs.

Source record↗

Balar: A SST GPU Component for Performance Modeling and Profiling

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of massive amounts of data have created a space for massively parallel accelerators capable of maintaining context for thousands of concurrent threads resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. One path for the design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. The SST framework has been proven to scale up to run simulations containing tens of thousands of nodes. A previous report described the initial integration of the open-source, execution-driven GPU simulator, GPGPU-Sim, into the SST framework. This report discusses the results of the integration and how to use the new GPU component in SST. It also provides examples of what it can be used to analyze and a correlation study showing how closely the execution matches that of a Nvidia V100 GPU when running kernels and mini-apps.

97 MATHEMATICS AND COMPUTING↗

SST-GPU: A Scalable SST GPU Component for Performance Modeling and Profiling

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of unprecedented amounts of data have created a space for massively parallel accelerators capable of maintaining context for thousands of concurrent threads resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. One path for the design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. The SST framework has been proven to scale up to run simulations containing tens of thousands of nodes. A previous report described the initial integration of the open-source, execution-driven GPU simulator, GPGPU-Sim, into the SST framework. This report discusses the results of the integration and how to use the new GPU component in SST. It also provides examples of what it can be used to analyze and a correlation study showing how closely the execution matches that of a Nvidia V100 GPU when running kernels and mini-apps.

97 MATHEMATICS AND COMPUTING↗