SEARCH · Search NASA

Results for “data layout optimization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2021

DEVELOPMENT OF A 25 MWTH FLAMELESS PRESSURIZED OXY-COMBUSTION PILOT

The Flameless Pressurized Oxy-Combustion (FPO) cycle, a novel flexible fuel technology, is being developed into a large pilot. This effort seeks to complete the preliminary engineering and planning of a 25 MWth Pilot Plant that will demonstrate the technology for scale-up to a commercial unit. The technology, pioneered by ITEA at the 5 MWth scale, must be brought to a higher technology readiness level (TRL) to be viable at the commercial scale. The 25 MWth pilot cycle was optimized for cost and technology development and demonstration. Preliminary drawings, layouts, and plans were defined. Process flow diagrams were used to describe the pilot configuration in greater detail. A heat and mass balance with stream data was created. A master equipment list specified the operating conditions for major pieces of equipment within the pilot using this heat and mass balance. The 25 MWth FPO pilot is assessed for environmental performance. A test campaign is developed to assess the type of test and number of hours required for pilot demonstration. The environmental performance is compared against projected performance at the commercial scale. This project builds upon extensive evaluation of the techno-economic performance of the FPO technology already performed by ITEA. This includes system improvements, such as the addition of a turbo-expander to the flue gas stream. Some of the performance-enhancing components are not as well defined as others. The primary goal of this effort was to bring all of the core cycle components to the same level of design maturity. A techno-economic assessment (TEA) evaluated the FPO technology at the commercial scale in comparison to the NETL baseline cases. The reference plants were used in combination with proprietary equipment estimates to build a plant capital cost and cost of electricity evaluation. FPO performed better than the sub-bituminous post-combustion capture cases. Further preliminary estimates of improvements to the FPO cycle show even further gains when compared to conventional carbon capture methods.

20 FOSSIL-FUELED POWER PLANTS↗

DOE OSTI2023

Code modernization strategies for short-range non-bonded molecular dynamics simulations

Modern HPC systems are increasingly relying on greater core counts and wider vector registers. Thus, applications need to be adapted to fully utilize these hardware capabilities. One class of applications that can benefit from this increase in parallelism are molecular dynamics simulations. In this paper, we describe our efforts at modernizing the ESPResSo++ simulation package for molecular dynamics by restructuring its particle data layout for efficient memory accesses and applying vectorization techniques to benefit the calculation of short-range non-bonded forces, which results in an overall three times speedup and serves as a baseline for further optimizations. We also implement fine-grained parallelism for multi-core CPUs through HPX, a C++ runtime system which uses lightweight threads and an asynchronous many-task approach to maximize concurrency. Our goal is to evaluate the performance of an HPX-based approach compared to the bulk-synchronous MPI-based implementation. This requires the introduction of an additional layer to the domain decomposition scheme that defines the task granularity. On spatially inhomogeneous systems, which impose a corresponding load-imbalance in traditional MPI-based approaches, we demonstrate that by choosing an optimal task size, the efficient work-stealing mechanisms of HPX can overcome the overhead of communication resulting in an overall 1.4 times speedup compared to the baseline MPI version.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

DOE OSTI2023

Computing the Properties of Matter with Leadership Computing Resources (Closeout Report for DE-SC0018121)

In order to add more capabilities to Halide, we have designed a new framework called Tiramisu and integrated this framework into Halide. Since Tiramisu enables Halide to target heterogeneous architectures, our development efforts have been refocused on Tiramisu. Most high-performance computer systems today are complex and increasingly heterogeneous; they may have CPUs, GPUs and FPGAs. Achieving best performance requires taking full advantage of all these different architectures. To address this issue, we have designed Tiramisu, an optimization framework that enables Halide (and other DSLs) to target heterogeneous architectures. Tiramisu is an optimization framework that takes as input a high level, architecture-independent representation of code and a set of scheduling and data mapping commands that guide code transformation. The input can either be generated by a domain-specific language (DSL) compiler such as Halide or directly written by a programmer. Tiramisu then applies the user-specified code and data-layout transformations and generates an architecture-specific, low-level intermediate representation (IR) that takes advantage of modern architectural features such as multicore parallelism, non-uniform memory (NUMA) hierarchies, clusters, and accelerators like GPUs and FPGAs. We integrated Tiramisu within Halide and implemented a representative set of benchmarks to evaluate this integration. Tiramisu is now open source and is available for public use (http://tiramisu-compiler.org/). A paper about Tiramisu was published, it shows that Tiramisu extends Halide with many new capabilities and that Tiramisu can generate efficient code for multicores, GPUs, FPGAs and distributed heterogeneous systems. The performance of code generated by the Tiramisu backends matches or exceeds hand optimized reference implementations. For example, the multicore backend matches the highly optimized Intel MKL library on many kernels and shows speedups reaching 4x over the original Halide. In addition to making Tiramisu more robust, we have used Tiramisu to implement a set of representative tensor operation for constructing baryon building blocks required for multi baryon contractions in LQCD. In order to implement this code, we needed to generalize Tiramisu in two ways: first we needed to support indirect array accesses, and second, we needed to add support for complex numbers to Tiramisu. The code generated by Tiramisu is 6x faster than the reference code. Our efforts towards an MPI based multi-node version of tiramisu have matured and the resulting code scales well on multiple nodes (tests up to 512 KNL nodes have been undertaken).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2026

Geomatchd

Geomatchd is a software tool to assist non-experts in the rapid conceptual design of geothermal district heating systems. This tool comprises three main parts: user-side heating and cooling demand profiles, district heating and cooling (DHC) network models for sizing and optimal layout selection, and geothermal system models for heat extraction calculation and cost comparison. The architecture of Geomatchd is opensource and is intended to simplify efforts by other coders to improve on existing functions, to add functions and to leverage available existing code and data – to improve the tool for public use. Geomatchd and the material supporting its development may provide a more intuitive window on district heating and the use of local shallow geothermal resources.

AS↗

DOE OSTI2018

pnnl/sven

This is a JavaScript library for a storyline layout algorithm. Storylines are adept at communicating complex change by encoding time on the x-axis and using the proximity of lines in the y direction to represent interaction between entities. The library in this disclosure takes as input a list of objects containing an id, time, and state. The output is a data structure that can be used to conveniently render a storyline visualization. Most importantly, the library computes the y-coordinate of the entities over time that decreases layout artifacts including crossings, wiggles, and whitespace. This is accomplished through multi-objective, multi-stage optimization problem, where the output of one stage produces input and constraints for the next stage.

Arendt, Dustin↗

DOE OSTI2017

Pure JavaScript Storyline Layout Algorithm

Source record↗

DOE OSTI2024

PyOED: An Extensible Suite for Data Assimilation and Model-Constrained Optimal Design of Experiments

This article describes PyOED, a highly extensible scientific package that enables developing and testing model-constrained optimal experimental design (OED) for inverse problems. Specifically, PyOED aims to be a comprehensive Python toolkit for model-constrained OED. The package targets scientists and researchers interested in understanding the details of OED formulations and approaches. It is also meant to enable researchers to experiment with standard and innovative OED technologies with a wide range of test problems (e.g., simulation models). OED, inverse problems (e.g., Bayesian inversion), and data assimilation (DA) are closely related research fields, and their formulations overlap significantly. Thus, PyOED is continuously being expanded with a plethora of Bayesian inversion, DA, and OED methods as well as new scientific simulation models, observation error models, and observation operators. These pieces are added such that they can be permuted to enable testing OED methods in various settings of varying complexities. The PyOED core is completely written in Python and utilizes the inherent object-oriented capabilities; however, the current version of PyOED is meant to be extensible rather than scalable. Specifically, PyOED is developed to “enable rapid development and benchmarking of OED methods with minimal coding effort and to maximize code reutilization.” This article provides a brief description of the PyOED layout and philosophy and provides a set of exemplary test cases and tutorials to demonstrate the potential of the package.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Positron Emission Tomography in Water Resources and Subsurface Energy Resources Engineering Research

Recent studies have demonstrated that positron emission tomography (PET) is a valuable tool for in-situ characterization of fluid transport in porous and fractured geologic media at the laboratory scale. While PET imaging is routinely used for clinical cancer diagnosis and preclinical medical research—and therefore imaging facilities are available at most research institutes—widespread adoption for applications in water resources and subsurface energy resources engineering have been limited by real and perceived challenges of working with this technique. In this study we discuss and address these challenges, and provide detailed analysis highlighting how positron emission tomography can complement and improve laboratory characterization of different subsurface fluid transport problems. The physics of PET are reviewed to provide a fundamental understanding of the sources of noise, resolution limits, and safety considerations. We then layout the methodology required to perform laboratory experiments imaged with PET, including a new protocol for radioactivity dosing optimization for imaging in geologic materials. Signal-to-noise and sensitivity analysis comparisons between PET and clinical X-ray computed tomography are performed to highlight how PET data can complement more traditional characterization methods, particularly for solute transport problems. Lastly, prior work is critically reviewed and discussed to provide a better understanding of the strengths and weakness of PET and how to best utilize PET-derived data for future studies.

02 PETROLEUM↗

DOE OSTI2017

TGE: Machine Learning Based Task Graph Embedding for Large-Scale Topology Mapping

Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and exchange data over the course of computation. Task mapping becomes a more challenging problem in staging applications, because not only data is exchanged between the staging tasks, but also the processes of a staging task may exchange data with each other. We propose a novel method, called Task Graph Embedding (TGE), that harnesses the observable graph structures of parallel applications and network topologies. TGE employs a machine learning based algorithm to find the best representation of a graph, called an embedding, onto a space in which the task-to-processor mapping problem can be solved. We evaluate and demonstrate the effectiveness of TGE experimentally with the communication patterns extracted from runs of XGC, a large-scale fusion simulation code, on Titan.

Choi, Jong Youl↗

DOE OSTI2025

CSP Systems Analysis 2022-2024 (Final Technical Report)

The CSP Systems Analysis project estimates the current market cost of CSP subsystems and technologies for use by the DOE Program and within NREL analysis tools. The project addresses upgrades to NREL's System Advisor Model (SAM) related to CSP, as well as development of new modules within SAM to expand the types of CSP systems that can be simulated and new tools for evaluating CSP subsystem performance or optimizing CSP system layouts, for example, SolarPILOT and SolTrace. The project evaluates the potential cost and performance of new CSP-relevant technologies and generally includes assessment of CSP technologies in support of the DOE subprogram. A primary goal of the CSP System Analysis project is to provide timely and accurate cost data to the DOE to assess the current state of CSP technologies as well as predict performance and cost for pre-commercial and emerging technologies that may impact the industry. Prior work in this task has produced technology cost reports and roadmaps for DOE and highlighted promising research paths that could reduce overall CSP cost, such as the supercritical CO2 power cycle and molten-salt trough systems. CSP Systems Analysis produces modeling tools to evaluate the performance of CSP systems, subsystems, or components, and journal articles, conference papers, technical reports and databases to disseminate information to the CSP industry. CSP technology costs are estimated and tracked using these tools as well as analysis of literature and industry sources. The CSP modeling tools and NREL analysis results are used by researchers; government, financial, and industry analysts; and other CSP stakeholders. The purpose of this final technical report is to summarize the key accomplishments of the past three years of this project. The project was divided into seven separate tasks, and in what follows, we describe the background, objectives, key accomplishments, and path forward for each task within the project, with one section of this report summarizing each task.

14 SOLAR ENERGY↗

DOE OSTI2013

A system-level cost-of-energy wind farm layout optimization with landowner modeling

This work applies an enhanced levelized wind farm cost model, including landowner remittance fees, to determine optimal turbine placements under three landowner participation scenarios and two land-plot shapes. Instead of assuming a continuous piece of land is available for the wind farm construction, as in most layout optimizations, the problem formulation represents landowner participation scenarios as a binary string variable, along with the number of turbines. The cost parameters and model are a combination of models from the National Renewable Energy Laboratory (NREL), Lawrence Berkeley National Laboratory, and Windustiy. The system-level cost-of-energy (COE) optimization model is also tested under two land-plot shapes: equally-sized square land plots and unequal rectangle land plots. The optimal COEs results are compared to actual COE data and found to be realistic. The results show that landowner remittances account for approximately 10% of farm operating costs across all cases. Irregular land-plot shapes are easily handled by the model. We find that larger land plots do not necessarily receive higher remittance fees. The model can help site developers identify the most crucial land plots for project success and the optimal positions of turbines, with realistic estimates of costs and profitability. (C) 2013 Elsevier Ltd. All rights reserved.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Compiler and Runtime Approaches to Enable Large-Scale Irregular Programs. Final report, July 2013 - July 2019

While regular algorithms, characterized by operations on dense matrices and arrays, have long been the mainstay of scientific, high-performance computing, irregular algorithms, which feature unpredictable accesses to pointer-based data structures, are becoming increasingly common in high performance computing, arising in graph analysis, data mining and visualization, among other domains. Unfortunately, the defining characteristics of irregular applications, their dynamic, unpredictable, data-dependent access patterns and data layouts, make achieving high performance on large scale systems difficult. Scaling applications to peta- and exa-scale requires carefully controlling communication and data movement and placement, an inherently difficult task when access patterns and data layouts are unpredictable! Most irregular applications that attain high performance must be painstakingly hand-written and hand-tuned, with few common principles or paradigms uniting various implementations and easing future development. Despite the increasing importance of irregular applications, there is little programmer knowledge, and even less compiler ability, devoted to optimizing them. This project aims to solve these problems. By allowing programmers to write irregular applications in high level forms, with at most a few annotations highlighting key structural properties, programmers can focus on developing their algorithms and methods. The compiler and run-time system can take on the tedious task of optimizing the application for execution at large scales, and can automatically provide efficient implementations. This will provide portability and ease maintenance for existing irregular applications, but, more importantly, open up whole new domains of computational science to large-scale, high-performance simulation codes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Data-Driven Method for Groundwater-Level Mapping and Monitoring-Well Network Optimization at Hanford

This report summarizes the initial results and outcomes of a physics-informed, data-driven groundwater level (GWL) mapping capability for the Hanford Site. GWL mapping at Hanford is typically conducted annually and requires a significant amount of computational and expert resources, and it does not allow assessment of the informational value of specific monitoring wells. The proposed method produces spatially and temporally resolved fields consistent with sparse, irregularly sampled, and nonuniformly distributed well measurements. Implemented successfully, this capability will allow rapid mapping of groundwater levels and provide an opportunity to optimize monitoring activities (both location and sampling frequency) based on data information value evaluation. The approach integrates a diffusion-based generative model – trained on MODFLOW simulation data from the Plateau-to-River (P2R) model – with score-based data assimilation (SDA), allowing observation-conditioned mapping without retraining for each monitoring-network layout.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Inferring safety critical events from vehicle kinematics in naturalistic driving environment: Application of deep learning Algorithms

Advances in sensing technology has enabled the collection of countless terabytes of second-by-second kinematics data. Such data provides opportunities for real-time monitoring of driving behavior and identification of safety critical events (SCEs) including crashes and near crashes. The concept of volatility is relevant in this context, which identifies instability and erratic variations in driving behavior prior to involvement in SCEs. This study utilized vehicle kinematics from a large-scale naturalistic driving data to develop a deep learning approach based on 1D convolutional neural networks (CNN) for inferring SCEs. The data are unique in the sense that such accurate pre-crash data at high fidelity are not available in traditional crash repositories. This study contributes to the literature by providing a first attempt at predicting responses to SCEs by developing deep learning-based CNN architectures using novel driving volatility based kinematic thresholds for a sample of 9553 events. The key contribution lies in developing a volatility-based CNN input layout that is acceptable to CNN schemes and represents the motion kinematics such as speed, acceleration and volatility measures. Several 1D-CNN architectures were developed using layers, numbers of convolutions, layer patterns, and kernels. Shallow and deep architectures were tested, revealing higher accuracy of shallow architectures in detecting SCEs. The optimal number of epochs were identified using an early stopping method while the CNN performance was improved by increasing the number of epochs. The ensemble CNN had the highest predictive accuracy of 95.6% for detection of crashes and near crashes, which was 2.5% higher than the optimal CNN using 20% hold out test data. The ensemble CNN also outperformed classical machine learning models and model performance reported in past studies on detection of SCEs. Finally, these results have implications for identification of safety hotspots and providing real-time alerts and warnings in connected and highly automated vehicle environment including society of automotive engineers levels 3–5.

42 ENGINEERING↗

DOE OSTI2020

A general-purpose method for Pareto optimal placement of flow rate and concentration sensors in networked systems – With application to wastewater treatment plants

The advent of affordable computing, low-cost sensor hardware, and high-speed and reliable communications have spurred installation of ubiquitous sensors in complex engineered systems. However, ensuring reliable data quality remains a challenge. Exploitation of redundancy among sensor signals can help improving the precision of measured variables, detecting the presence of gross errors, and identifying faulty sensors. The cost of sensor ownership, maintenance efforts in particular, can still be cost-prohibitive however. Maximizing the ability to assess and control data quality while minimizing the cost of ownership thus requires a careful sensor placement. To solve this challenge, in this work we develop a generally applicable method to solve the multi-objective sensor placement problem in systems governed by linear and bilinear balance equations. Importantly, the method computes all Pareto-optimal sensor layouts with conventional computational resources and requires no information about the expected sensor quality.

42 ENGINEERING↗

DOE OSTI2025

Data Structure Alchemy

In an increasingly more data-driven world, the project set out to uncover the first principles of data-structure design, chart the immense design space they form, and build automation that can synthesize an optimal structure, or even a whole storage engine, for any given workload, hardware platform, and cost target. Data structures are at the center of every computational system and are directly responsible for its performance. Two core technical thrusts were defined: 1) Mapping design spaces for key data-centric abstractions (filters, hash functions, storage-engine layouts, neural-network topologies, blockchain protocols, image layouts, etc.). 2) Developing search & synthesis algorithms, initially analytical cost models, later neural-guided bi-level optimisers that navigate sextillions of candidate designs in seconds and materialise the best one as ready‐to-run code. This report distills the key insights, accomplishments, and impact.

97 MATHEMATICS AND COMPUTING↗