Search NASA⌕ Search

SEARCH · Search NASA

Results for “execution time”

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 523 records · Page 29

Benchmarking Bayesian Optimization Frameworks and Acquisition Strategies for Materials Discovery and Autonomous Laboratories

Bayesian optimization (BO) can accelerate materials discovery by guiding expensive experiments toward the most promising processing conditions. We systematically compare five BO surrogate and framework combinations (Gaussian processes in Ax, Gaussian processes and Monte-Carlo neural networks in BayBE, random forests in Lolopy, and tree-structured Parzen (TPE) estimators in Hyperopt) on three benchmarks that mimic common materials design tasks (a discrete solid-electrolyte composition space, a hybrid discrete/continuous laminate-composite design problem solved with micromechanics modeling, and the continuous Ishigami analytic function which is a standard optimization benchmark). Each BO surrogate is paired with posterior mean, probability of improvement, and expected improvement acquisition functions and run for 100 trials from randomized initial samples with uniform random search providing a control. Across five random seeds per setting, BayBE’s Gaussian-process surrogate with expected improvement consistently reached ≥95 % of the known optimum in the fewest evaluations, while Lolopy’s random forest matched or exceeded GP performance on purely categorical or mixed spaces at a higher computational cost. Posterior mean alone often stagnated at local optima, underscoring the need for exploration, whereas probability and expected improvement balanced exploration and exploitation leading to better optimization in fewer trials. Execution times ranged from milliseconds for TPE to minutes for neural-network and random-forest surrogates. These results establish baseline expectations for BO in automated materials laboratories and highlight expected improvement with Gaussian processes as a reliable first choice, with random forests offering a strong alternative when categorical variables dominate. The benchmark suite and code are released to facilitate future surrogate, acquisition, and constraint-handling research in data-driven materials optimization.

Bayesian optimization↗

Scalable Energy Efficiency with Resilience for High Performance Computing Systems: A Quantitative Methodology

Energy efficiency and resilience are two crucial challenges for HPC systems to reach exascale. While energy efficiency and resilience issues have been extensively studied individually, little has been done to understand the interplay between energy efficiency and resilience for HPC systems. Decreasing the supply voltage associated with a given operating frequency for processors and other CMOS-based components can significantly reduce power consumption. However, this often raises system failure rates and consequently increases application execution time. In this work, we present an energy saving undervolting approach that leverages the mainstream resilience techniques to tolerate the increased failures caused by undervolting.

energy, resilience↗

Energy Savings Performance Contract Energy Sales Agreement Toolkit

FEMP developed the Energy Savings Performance Contracting Energy Sales Agreement (ESPC ESA) Toolkit to provide federal agency contracting officers and other acquisition team members with information that will facilitate the timely execution of ESPC ESA projects.

energy sales agreements↗

Data-dependence Profiling to Enable Safe Thread Level Speculation

Data-dependence profling is a technique that enables a com- piler to judiciously decide when the execution of a loop | which the compiler could not prove to be dependence free | should be speculated through the use of Thread Level Spec- ulation (TLS). The data collected by a data-dependence pro- fler can be used to predict if may dependencies reported by a compiler static analysis are likely to materialize at runtime. A cost analysis can then be used to decide that some loops with a lower probability of dependence should be specula- tively parallelized. This paper addresses the question as to whether a loops' dependence behaviour changes when the in- put to the program changes | a study of 57 different bench- marks indicates that it usually does not change. Then the paper describes SpecEval, an automatic speculative paral- lelization framework that uses single-input data-dependence profles to find speculation candidates in the SPEC2006 and PolyBench/C benchmarks. This paper also presents a per- formance evaluation of TLS implementation in IBM's Blue- Gene/Q supercomputer and shows that the performance of TLS is affected by several factors, including the number of speculated loops, the execution-time coverage of speculated loops, the miss-speculation overhead, the L1 cache miss rate and the effect on dynamic instruction path length.

Bhattacharyya, Arnamoy↗

Towards Scalable Deep Learning via I/O Analysis and Optimization

Deep learning systems have been growing in prominence as a way to automatically characterize objects, trends, and anomalies. Given the importance of deep learning systems, researchers have been investigating techniques to optimize such systems. An area of particular interest has been using large supercomputing systems to quickly generate effective deep learning networks: a phase often referred to as “training” of the deep learning neural network. As we scale existing deep learning frameworks—such as Caffe—on these large supercomputing systems, we notice that the parallelism can help improve the computation tremendously, leaving data I/O as the major bottleneck limiting the overall system scalability. In this paper, we first present a detailed analysis of the performance bottlenecks of Caffe on large supercomputing systems. Our analysis shows that the I/O subsystem of Caffe—LMDB—relies on memory-mapped I/O to access its database, which can be highly inefficient on large-scale systems because of its interaction with the process scheduling system and the network-based parallel filesystem. Based on this analysis, we then present LMDBIO, our optimized I/O plugin for Caffe that takes into account the data access pattern of Caffe in order to vastly improve I/O performance. Our experimental results show that LMDBIO can improve the overall execution time of Caffe by nearly 20-fold in some cases.

Pumma, Sarunya↗

BiGlobal Secondary Instabilities of Roughness-Induced Transient Growth

Roughness-induced transient disturbances distort laminar boundary layers and can lead to premature transition if the roughness is of sufficient height and shape. If transition does occur, it does so through a high-frequency "secondary" instability of the roughness wake. A BiGlobal secondaryinstability code has been developed to solve the stability problem downstream of roughness. The code implements multiple solvers for incompressible/compressible, inviscid/viscous, and temporal/spatial stability. High-order finite differences, sparse matrix linear algebra, LU decomposition, and Arnoldi iterations are used to solve the resulting generalized eigenvalue problem. The code has been used to evaluate the stability properties of experimental roughness-induced transient growth on a flat-plate at low-speed and a slightly blunted cone at M∞= 6. The resulting mode shapes, growth rates, and spatial N-factors show excellent agreement with experimental data. The viscous mode shapes show the best agreement with the experimental disturbance profiles. Yet, execution time can be reduced by an order-of-magnitude by using the inviscid solvers with only modest differences in growth rates.

BiGlobal↗

Exploring Integer Sum Reduction using Atomics on Intel CPU

Atomic functions are useful in updating a shared variable by multiple threads, barrier synchronizations, constructing complex data structures, and building high-level frameworks. In this paper, we focus on the evaluation and analysis of integer sum reduction, a common data parallel primitive. We convert the sequential reduction into parallel OpenCL implementations on the CPU. We also develop three micro kernels, which allow us to understand the relationships between the kernel performance and the operations involved in reduction. The results of the micro kernels show that increasing the work-group size linearly can linearly improve the kernel performance. There is a sweet spot in the relationship between the work-group size and barrier synchronization overhead. The performance of the atomics over local memory are not sensitive to the work-group size. The sum reduction kernel with vectorized memory accesses can improve the performance of the baseline kernel for a wide range of work-group sizes. However, the vectorization efficiency shrinks with the growing work-group size. We also find that the vendor’s default OpenCL kernel optimization does not improve the kernel performance. On average, disabling the optimization can reduce the execution time of the kernel with vectorized memory accesses by 15%. We attribute the performance drop to the fact that the default kernel optimizations instantiate a large number of atomics over global memory when implicitly vectorizing the kernel computation.

atomics↗

Understanding the Impact of Dynamic Power Capping on Application Progress

Electrical power has become an important design constraint in high-performance computing (HPC) systems. On future HPC machines, power is likely to be a budgeted resource and thus managed dynamically. Power management software needs to reliably measure application performance at runtime in order to respond effectively to changes in application behavior. Execution time tells us little about how the science in the application is progressing toward an application-defined end goal. To the best of our knowledge, no study has defined or categorized online application progress in the context of power management. Based on semi-structured interviews with HPC application-specialists, we define an online notion of progress—an application-specific metric that can be monitored at runtime to provide a sense of the rate at which application science is being performed. Using instrumentation, we characterize and categorize the progress of various production scientific applications and benchmarks. We propose a model of the impact of dynamic power capping on application progress. By experimental evaluation, we show that our model accurately captures the general behavior of the progress of different classes of applications under a power cap. We believe that such a model is an important first step toward the design of more dynamic power management policies for HPC systems.

application progress↗

Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations

A method of increasing an efficiency at which a plurality of threshold gates arranged as neuromorphic hardware is able to perform a linear algebraic calculation having a dominant size of N. The computer-implemented method includes using the plurality of threshold gates to perform the linear algebraic calculation in a manner that is simultaneously efficient and at a near constant depth. “Efficient” is defined as a calculation algorithm that uses fewer of the plurality of threshold gates than a naïve algorithm. The naïve algorithm is a straightforward algorithm for solving the linear algebraic calculation. “Constant depth” is defined as an algorithm that has an execution time that is independent of a size of an input to the linear algebraic calculation. The near constant depth comprises a computing depth equal to or between O(log(log(N)) and the constant depth.

97 MATHEMATICS AND COMPUTING↗

Cutting the Deployment Costs of Physics-Based MPC in Buildings by Simulation-Based Imitation Learning

It has been shown that model predictive control (MPC) is a promising solution for energy-efficient building operations. However, the deployment of MPC in a large portion of the building stock has not been possible partially because of high installation costs. Every building is unique and requires a tailored MPC solution. The best performing solutions are often based on physics-based modeling, which is, however, computationally expensive and requires dedicated software. A promising direction that tackles this problem is to train a neural network-based optimal control policy to imitate the behavior of physics-based MPC from the simulation data generated offline. The neural networks give control actions that closely approximate those produced by physics-based MPC, but with a fraction of the computational and memory requirements and without the need for licensed software. The main advantage of the proposed approach stems from simple evaluation at execution time, leading to low computational footprints and easy deployment on embedded HW platforms. In the case study, we present the energy savings potential of physics-based MPC applied to an office building in Belgium. We demonstrate how neural network approximators can be used to cut the implementation and maintenance costs of MPC deployment without compromising performance. We also critically assess the presented approach by pointing out the remaining challenges and open research questions.

Drgona, Jan↗

Stripping off the implementation complexity of physics-based model predictive control for buildings via deep learning

Over the past decade, model predictive control (MPC) has been considered as the most promising solution for intelligent building operation. Despite extensive effort, transfer of this technology into practice is hampered by the need to obtain an accurate controller model with minimum effort, the need of expert knowledge to set it up, and the need of increased computational power and dedicated software to run it. A promising direction that tackles the last two problems was proposed by approximate explicit MPC where the optimal control policies are learned from MPC data via a suitable function approximator, e.g., a deep learning (DL) model. The main advantage of the proposed approach stems from simple evaluation at execution time leading to low computational footprints and easy deployment on embedded HW platforms. We present the energy savings potential of physics-based (also called 'white-box') MPC applied to an office building in Belgium. Moreover, we demonstrate how deep learning approximators can be used to cut the implementation and maintenance costs of MPC deployment without compromising performance. We also critically assess the presented approach by pointing out the major challenges and remaining open-research questions.

Drgona, Jan↗

Parallel Particle Advection Bake-Off for Scientific Visualization Workloads

There are multiple algorithms for parallelizing particle advection for scientific visualization workloads. While many previous studies have contributed to the understanding of individual algorithms, our study aims to provide a holistic understanding of how algorithms perform relative to each other on various workloads. To accomplish this, we consider four popular parallelization algorithms and run a “bake-off” study (i.e., an empirical study) to identify the best matches for each. The study includes 216 tests, going to a concurrency of up to 8192 cores and considering data sets as large as 34 billion cells with 300 million particles. Overall, our study informs three important research questions: (1) which parallelization algorithms perform best for a given workload?, (2) why?, and (3) what are the unsolved problems in parallel particle advection? In terms of findings, we find that the seeding box is the most important factor in choosing the best algorithm, and also that there is a significant opportunity for improvement in execution time, scalability, and efficiency.

Pugmire, Dave↗

Design Guidelines for Deployable Wind Turbines for Defense and Disaster Response Missions

Access to on-site electrical energy is critical to ensuring a successful military or humanitarian response to conflicts and disasters. These missions typically rely on access to liquid fuel that could be vulnerable to disruption or attack during transport. Generating power on location with wind technology can reduce this risk and enhance mission reach by diversifying energy sources. Common characteristics of these missions are short planning and execution time horizons and a global scope of potential locations. Compared to conventional wind turbine applications, defense and disaster response applications place a premium on rapid shipping and installation, short-duration operation (days to months), and quick teardown upon mission completion. These design drivers depart from features found in conventional distributed wind turbines, thus necessitating unique design guidance. The supporting information for this guidance comes from available relevant references, technical analyses, and input from industry and military stakeholders. This poster serves as a summary of project publications which presents the best currently available design guidance for deployable wind turbines to facilitate the effective development and acquisition of technology solutions to support mission success. This Defense and Disaster Deployable Turbine Project (D3T) is a multi-laboratory effort led by Sandia National Laboratories and funded by the U.S. Department of Energy Office of Energy Efficiency and Renewable Energy Wind Energy Technologies Office.

deployable wind↗

Evaluating the Practicability of Multiphase CFD for BWR Fuel Assembly Analysis

Multiphase computational fluid dynamics (M-CFD) models of a boiling water reactor (BWR) fuel assembly have been generated in the commercial CFD code, STAR-CCM+ Ver.11.04.010-R8. The Eulerian multiphase approach was employed, in combination with a baseline ‘Zero Closure model’ for two-phase flow boiling, applicable to high void fraction regimes. The capability and practicability of MCFD for BWR fuel assembly were evaluated against the international OECD/NRC BWR Full-size Finemesh Bundle Test (BFBT) benchmark data. The benchmark selected, BFBT-4101-61, is a steady-state full power case, with high void fraction conditions. Geometrical modeling and mesh construction of BWR assemblies introduce challenges in generating high quality computational meshes, while retaining a low cell count to allow acceptable runtimes. In order to evaluate the scalability of the CFD code, parallel CFD simulations were carried out with the High Performance Computing (HPC) system of the Idaho National Laboratory. M-CFD results display good agreement with the experimental data for both local void fraction distribution and exit quality. The parallel speedup factor is linearly proportional to the number of processors up to 500 cores, and retains over 92% efficiency with 1000 cores. The execution time of the simulation decreased exponentially with increasing number of processors while the cost of the simulation increased linearly. The proposed baseline closure, in combination with the parallel performance of the STAR-CCM+ code demonstrated promising capabilities for analyzing BWR fuel assemblies.

97 MATHEMATICS AND COMPUTING↗

Hexagonal Distributed Embedded Energy Converters (HexDEECs)

Distributed Embedded Energy Converter Technologies (DEEC-Tec) is a new domain for marine renewable energy research that utilizes a conglomeration of small distributed embedded energy converters (DEECs) that, in aggregate, form larger metamaterial frameworks. These resulting DEEC-Tec metamaterials can then, in turn, be used to construct flexible ocean wave energy converters called flexWECs. DEEC-Tec enables flexWECs: (i) to be inherently broad-banded ocean wave frequency energy converters and (ii) to have an inherent lack of highly loaded rigid bodies. The DEEC-Tec domain also benefits the marine renewable energy domain by inherently availing ways that marine energy can be harvested and converted that heretofore has not yet been considered possible: real-time execution of transforming topologies (e.g., actively changing a flexWEC's shape and form) and morphologies (e.g., actively changing a flexWEC's stiffness and damping throughout its entire structure). Presented, is one specific type of DEEC, a HexDEEC, that shows promise in aiding the adoption and further development of the DEEC-Tec domain - it is a small energy transducer being developed by the United States National Renewable Energy Laboratory. The HexDEEC is a small (characteristic length approximating a centimeter) energy transducer that converts the dynamic deformations of an elastomer into electricity through a charging-discharging cycle of a capacitor whose capacitance is varied by those elastic deformations. The HexDEEC is composed of a hyperelastic hexagonal housing (nominally silicon rubber) with six electrodes on its inner faces. The upper three electrodes share the same charge while the lower three electrodes oppose the upper electrode charges. Externally, the HexDEEC has two arms extending away from the middle vertices of the hexagon. Via principles governing the relationship between electrical capacitance and electrical potential (voltage and charge), electricity is generated when the HexDEEC's arms are dynamically pulled or released under tensile loading as doing so causes the distance between the upper and lower sets of electrodes to change - varying the energy converter's overall capacitance. Analytical and numerical modeling have already been used to estimate the electrical energy produced by a HexDEEC. The cursory models approximate the HexDEEC as a parallel plate variable capacitor - simplifying from six to two opposing plates with a constant dielectric volume between those two plates. To account for the elastic HexDEEC material properties, software such as SolidWorks and STAR-CCM+ have been used to generate hyperelastic models; notably, Mooney-Rivlin based models. Individual HexDEECs have been fabricated by drawing uncured liquid silicon rubber into molds via vacuum pressure. To simplify manufacturing, HexDEEC sub-components - e.g., electrodes, wires - can be placed within those molds such that they are directly embedded into the hexagonal housing during the curing process. Furthermore, DEEC-Tec metamaterials can be created by interweaving or sequentially layering multiple HexDEEC strands together. The HexDEEC based metamaterial could then generate electricity through its gross deformations. Ultimately, HexDEECs represent a specific type of energy transducer that can be leveraged, by the DEEC-Tec domain, to create metamaterials used to construct novel flexWECs.

DEEC-Tec↗

Development of Remote Dry Cutting Technology for Reactor Vessel Segmentation - 19176

Decommissioning of nuclear power plants is becoming a large market due to the many reactors reaching their operational lifetime limit in the near future. One of the first activities in a decommissioning project is to segment the reactor internals and the reactor vessel. These activities are also one of the more complex ones since they deal with most of the radioactivity inventory that is left in the plant after the spent fuel is gone. They are almost always on the critical path, so an improvement in execution time will be favorable for the entire decommissioning program. Westinghouse has been successful for more than 30 years in more than 40 segmentation projects globally. The traditional technology that has been used in these projects has up until now been underwater mechanical cutting of both the reactor internals and the reactor vessel. Underwater mechanical cutting is proven and very reliable, but it is slow and since there are major advantages to the decommissioning program with improvements in schedule performance, Westinghouse is developing alternative technologies both as part of current offerings but also as entire new concepts. For reactor vessel cutting, Westinghouse has developed a new concept involving thermal cutting in a dry environment. The benefit of dry cutting is the speed of the cutting and the subsequent schedule and cost improvements. A dry environment also means that the pools can be drained which means that a critical activity can be moved forward in the schedule and that there will need to be less monitoring and controlling with no pumps, cooling and recirculation system that need to be operated. Going from underwater mechanical to dry thermal cutting reduces the on-site schedule by more than 50%. The dry cutting concept development considers both PWR and BWR reactors. Some of the challenges of dry thermal cutting involve the creation of radioactive off-gases and how to ventilate these, the extreme heat generation, remote handling of the thermal equipment, cutting station arrangements and how to remove the insulation around the reactor vessel. Depending on the concept the reactor vessel might need to be lifted from the pit in one piece, which also poses some challenges due to the weight, volume and radioactivity of the vessel. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A new track finding algorithm based on a multi-dimensional extension of the Hough Transform

We introduce a new pattern recognition algorithm for track finding in High Energy Physics Experiments based on an extension of the Hough Transform to multiple dimensions. A remarkable property of this algorithm is that the execution time is simply proportional to the total number of the hits to be processed, making it particularly attractive for high occupancy situations. The algorithm needs to be trained using a sufficiently large set of simulated tracks. The same track finding algorithm can be used for very different detector geometries and only the set of simulated tracks used for training needs to be changed. The particular structure of the algorithm also lends itself naturally to parallel hardware implementations which, combined with its intrinsic flexibility, should provide a most powerful tool for triggering at future colliders.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗