Search NASA⌕ Search

SEARCH · Search NASA

Results for “benchmark problem”

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 1,549 records · Page 86

Porosity Area Fraction Analysis of Bonded Borosilicate Specimens From in-Situ Optical Imagery

Image segmentation methods are routinely used to analyze data derived in nondestructive testing scenarios. A typical problem in this area is to estimate porosity from X-ray Computed Tomography (CT) inspections. This investigation aims to understand the effectiveness of open-source image segmentation methods for porosity estimation from optical images in the context of strength analysis of bonded materials and provides a benchmark of performance against a standard commercial software package. The rank ordering of the specimens by porosity area fraction is consistent across both methods.

Porosity area fraction↗

An Analysis Framework for Investigating the Trade-offs Between System Performance and Energy Consumption in a Heterogeneous Computing Environment

Rising costs of energy consumption and an ongoing effort for increases in computing performance are leading to a significant need for energy-efficient computing. Before systems such as supercomputers, servers, and datacenters can begin operating in an energy-efficient manner, the energy consumption and performance characteristics of the system must be analyzed. In this paper, we provide an analysis framework that will allow a system administrator to investigate the tradeoffs between system energy consumption and utility earned by a system (as a measure of system performance). We model these trade-offs as a bi-objective resource allocation problem. We use a popular multi-objective genetic algorithm to construct Pareto fronts to illustrate how different resource allocations can cause a system to consume significantly different amounts of energy and earn different amounts of utility. We demonstrate our analysis framework using real data collected from online benchmarks, and further provide a method to create larger data sets that exhibit similar heterogeneity characteristics to real data sets. This analysis framework can provide system administrators with insight to make intelligent scheduling decisions based on the energy and utility needs of their systems.

Friese, Ryan↗

Learning Deep Neural Network Representations for Koopman Operators of Nonlinear Dynamical Systems

The Koopman operator has recently garnered much attention for its value in dynamical systems analysis and data-driven model discovery. However, its application has been hindered by the computational complexity of extended dynamic mode decomposition; this requires a combinatorially large basis set to adequately describe many nonlinear systems of interest, e.g. cyber-physical infrastructure systems, biological networks, social systems, and fluid dynamics. Often the dictionaries generated for these problems are manually curated, requiring domain-specific knowledge and painstaking tuning. In this paper we introduce a deep learning framework for learning Koopman operators of nonlinear dynamical systems. We show that this novel method automatically selects efficient deep dictionaries, outperforming state-of-the-art methods. We benchmark this method on partially observed nonlinear systems, including the glycolytic oscillator and show it is able to predict quantitatively 100 steps into the future, using only a single timepoint, and qualitative oscillatory behavior 400 steps into the future.

koopman operators, machine learning, deep learning↗

A Programming Model for Massive Data Parallelism with Data Dependencies

Accelerating processors can often be more cost and energy effective for a wide range of data-parallel computing problems than general-purpose processors. For graphics processor units (GPUs), this is particularly the case when program development is aided by environments such as NVIDIA s Compute Unified Device Architecture (CUDA), which dramatically reduces the gap between domain-specific architectures and general purpose programming. Nonetheless, general-purpose GPU (GPGPU) programming remains subject to several restrictions. Most significantly, the separation of host (CPU) and accelerator (GPU) address spaces requires explicit management of GPU memory resources, especially for massive data parallelism that well exceeds the memory capacity of GPUs. One solution to this problem is to transfer data between the GPU and host memories frequently. In this work, we investigate another approach. We run massively data-parallel applications on GPU clusters. We further propose a programming model for massive data parallelism with data dependencies for this scenario. Experience from micro benchmarks and real-world applications shows that our model provides not only ease of programming but also significant performance gains.

43 PARTICLE ACCELERATORS↗

Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model

In this paper we present a time-parallel algorithm for the 3D neutrons calculation of a transient model in a nuclear reactor core. The neutrons calculation consists in numerically solving the time dependent diffusion approximation equation, which is a simplified transport equation. The numerical resolution is done with finite elements method based on a tetrahedral meshing of the computational domain, representing the reactor core, and time discretization is achieved using a θ-scheme. The transient model presents moving control rods during the time of the reaction. Therefore, cross-sections (piecewise constants) are taken into account by interpolations with respect to the velocity of the control rods. The parallelism across the time is achieved by an adequate use of the parareal in time algorithm to the handled problem. This parallel method is a predictor corrector scheme that iteratively combines the use of two kinds of numerical propagators, one coarse and one fine. Our method is made efficient by means of a coarse solver defined with large time step and fixed position control rods model, while the fine propagator is assumed to be a high order numerical approximation of the full model. The parallel implementation of our method provides a good scalability of the algorithm. Numerical results show the efficiency of the parareal method on large light water reactor transient model corresponding to the Langenbuch–Maurer–Werner benchmark.

97 MATHEMATICS AND COMPUTING↗

Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery

Purpose: The authors propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization problem, and eliminates the need for a separate arc-sequencing step. Methods: In this model, a 360° arc is divided into a given number of arc segments in which the leaves move unidirectionally. This facilitates an algorithm that determines the optimal piecewise linear leaf trajectories for each arc segment, which are deliverable in a given treatment time. Multileaf collimator constraints, including maximum leaf speed and interdigitation, are accounted for explicitly. The algorithm is customized to allow for VMAT delivery using constant gantry speed and dose rate, however, the algorithm generalizes to variable gantry speed if beneficial. Results: The authors demonstrate the method for three different tumor sites: a head-and-neck case, a prostate case, and a paraspinal case. The authors first obtain a reference plan for intensity modulated radiotherapy (IMRT) using fluence map optimization and 20 intensity-modulated fields in equally spaced beam directions, which is beyond the standard of care. Modeling the typical clinical setup for the treatment sites considered, IMRT plans using seven or nine beams are also computed. Subsequently, VMAT plans are optimized by dividing the 360° arc into 20 corresponding arc segments. Assuming typical machine parameters (a dose rate of 600 MU/min, and a maximum leaf speed of 3 cm/s), it is demonstrated that the optimized VMAT plans with 2–3 min delivery time are of noticeably better quality than the 7–9 beam IMRT plans. The VMAT plan quality approaches the quality of the 20-beam IMRT benchmark plan for delivery times between 3 and 4 min. Conclusions: The results indicate that high quality treatments can be delivered in a single arc with 20 arc segments if sufficient time is allowed for modulation in each segment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Nanosecond machine learning regression with deep boosted decision trees in FPGA for high energy physics

We present a novel application of the machine learning / artificial intelligence method called boosted decision trees to estimate physical quantities on field programmable gate arrays (FPGA). The software package fwXmachina features a new architecture called parallel decision paths that allows for deep decision trees with arbitrary number of input variables. It also features a new optimization scheme to use different numbers of bits for each input variable, which produces optimal physics results and ultraefficient FPGA resource utilization. Problems in high energy physics of proton collisions at the Large Hadron Collider (LHC) are considered. Estimation of missing transverse momentum (E T miss ) at the first level trigger system at the High Luminosity LHC (HL-LHC) experiments, with a simplified detector modeled by Delphes, is used to benchmark and characterize the firmware performance. The firmware implementation with a maximum depth of up to 10 using eight input variables of 16-bit precision gives a latency value of $\mathcal{O}$(10) ns, independent of the clock speed, and $\mathcal{O}$(0.1)% of the available FPGA resources without using digital signal processors.

Instruments & Instrumentation↗

Angular-momentum projection in coupled-cluster theory: Structure of 34 Mg

Single- reference coupled-cluster theory is an accurate and affordable computational method for the nuclear many-body problem. For open-shell nuclei, the reference state typically breaks rotational invariance and angular momentum must be restored as a good quantum number. We perform angular-momentum projection after variation and employ the disentangled coupled-cluster formalism and a Hermitian approach. We compare our results with benchmarks for 8 Be and 20 Ne using a two-nucleon interaction from chiral effective field theory and for pf-shell nuclei within the traditional shell model. We compute the rotational band in the exotic nucleus 34 Mg and find agreement with data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve further as more functionality is added in the future.

97 MATHEMATICS AND COMPUTING↗

IMHO Fine-Tuning Improves Claim Detection

Claims are the central component of an argument. Detecting claims across different domains or data sets can often be challenging due to their varying conceptualization. We propose to alleviate this problem by fine tuning a language model using a Reddit corpus of 5.5 million opinionated claims. These claims are self-labeled by their authors using the internet acronyms IMO/IMHO (in my (humble) opinion). Empirical results show that using this approach improves the state of art performance across four benchmark argumentation data sets by an average of 4 absolute F1 points in claim detection. As these data sets include diverse domains such as social media and student essays this improvement demonstrates the robustness of fine-tuning on this novel corpus.

Chakrabarty, Tuhin↗

Hierarchical Division and Clustering of Group Structures

When using multigroup neutron transport models, it is important to choose a suitable group structure due to the impact on runtime and accuracy. Group structures at LANL have been largely pared down to a handful of commonly used group structures, such as the LANL-30 and LANL-70 group structures. By identifying the key boundaries for a given problem, more insight can be gained into why the commonly used group structures are accurate and when they are inaccurate. This work focuses on using hierarchical division and agglomeration methods to identify the most critical boundaries in these group structures, using the ICSBEP HEU-MET-FAST-001-001 benchmark as a case study.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Multi-partitioning for ADI-schemes on message passing architectures

A kind of discrete-operator splitting called Alternating Direction Implicit (ADI) has been found to be useful in simulating fluid flow problems. In particular, it is being used to study the effects of hot exhaust jets from high performance aircraft on landing surfaces. Decomposition techniques that minimize load imbalance and message-passing frequency are described. Three strategies that are investigated for implementing the NAS Scalar Penta-diagonal Parallel Benchmark (SP) are transposition, pipelined Gaussian elimination, and multipartitioning. The multipartitioning strategy, which was used on Ethernet, was found to be the most efficient, although it was considered only a moderate success because of Ethernet's limited communication properties. The efficiency derived largely from the coarse granularity of the strategy, which reduced latencies and allowed overlap of communication and computation.

Vanderwijngaart, Rob F.↗

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗

Demonstration and Verification of Thermo-Mechanical Bowing in a Limited Free-Bow SFR Concept Using MOOSE

Core bowing due to thermal gradients and irradiation induced swelling and creep introduces significant reactivity feedback effects in liquid metal-cooled fast spectrum reactors. During startup, normal operations, and transient events, differential thermal and flux gradients cause expansion, creep, and swelling, which results in bowing in preferential directions depending on local material properties and load-pad and restraint-ring design. The bowing phenomenon produces negative reactivity during accident conditions provided the restraint system has been properly designed to optimally guide the deformation outwards in the active core region. Under the Department of Energy Nuclear Energy Advanced Modeling and Simulation program, a Multiphysics Object Oriented Simulation Environment (MOOSE)-based multiphysics approach to model core bowing is being developed. The present work expands on previous modeling of simpler International Atomic Energy Agency (IAEA) verification problems with these tools by modeling IAEA Verification Problem 4, which involves a symmetric sector of a reactor core with ducted assemblies undergoing differential thermal expansion due to thermal gradients bowing outward with duct-to-duct contact. This model is available on the National Reactor Innovation Center Virtual Test Bed repository. This example was verified against benchmark participant results, which includes bowing deformation evaluation and duct-to-duct interactions at load pads with mechanical contact.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Transferable Reinforcement Learning for Smart Homes: Preprint

To harness the great amount of untapped resources at the demand side, smart home technology plays a vital role in solving the "last mile" problem in smart grid. Reinforcement learning (RL), which has demonstrated an outstanding performance in solving many sequential decision-making problems, can be a great candidate to be used in smart home control. For instance, many studies have started investigating the load scheduling problem under dynamic pricing scheme. Based on those, this study aims at providing an affordable solution to encourage a higher smart home adoption rate. Specifically, we investigate combining transfer learning (TL) with RL to reduce the training cost of an optimal RL control policy. Given an optimal policy for a benchmark home, TL can jump-start the RL training of a policy for a new home, which has different appliances and user preferences. Simulation results show that by leveraging TL, RL training converges faster and requires much less computing time for new homes that are similar to the benchmark home. In all, this study proposes a cost-effective approach for training RL control policies for homes at scale, which ultimately reduces the controller's implementation costs, increases the adoption rate of RL controllers, and makes more homes grid-interactive.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION,↗

Building Commissioning: A Golden Opportunity for Reducing Energy Costs and Greenhouse-gas Emissions

The aim of commissioning new buildings is to ensure that they deliver, if not exceed, the performance and energy savings promised by their design. When applied to existing buildings, commissioning identifies the almost inevitable 'drift' from where things should be and puts the building back on course. In both contexts, commissioning is a systematic, forensic approach to quality assurance, rather than a technology per se. Although commissioning has earned increased recognition in recent years - even a toehold in Wikipedia - it remains an enigmatic practice whose visibility severely lags its potential. Over the past decade, Lawrence Berkeley National Laboratory has built the world's largest compilation and meta-analysis of commissioning experience in commercial buildings. Since our last report (Mills et al. 2004) the database has grown from 224 to 643 buildings (all located in the United States, and spanning 26 states), from 30 to 100 million square feet of floorspace, and from $17 million to $43 million in commissioning expenditures. The recorded cases of new-construction commissioning took place in buildings representing $2.2 billion in total construction costs (up from 1.5 billion). The work of many more commissioning providers (18 versus 37) is represented in this study, as is more evidence of energy and peak-power savings as well as cost-effectiveness. We now translate these impacts into avoided greenhouse gases and provide new indicators of cost-effectiveness. We also draw attention to the specific challenges and opportunities for high-tech facilities such as labs, cleanrooms, data centers, and healthcare facilities. The results are compelling. We developed an array of benchmarks for characterizing project performance and cost-effectiveness. The median normalized cost to deliver commissioning was $0.30/ft2 for existing buildings and $1.16/ft2 for new construction (or 0.4% of the overall construction cost). The commissioning projects for which data are available revealed over 10,000 energy-related problems, resulting in 16% median whole-building energy savings in existing buildings and 13% in new construction, with payback time of 1.1 years and 4.2 years, respectively. In terms of other cost-benefit indicators, median benefit-cost ratios of 4.5 and 1.1, and cash-on-cash returns of 91% and 23% were attained for existing and new buildings, respectively. High-tech buildings were particularly cost-effective, and saved higher amounts of energy due to their energy-intensiveness. Projects with a comprehensive approach to commissioning attained nearly twice the overall median level of savings and five-times the savings of the least-thorough projects. It is noteworthy that virtually all existing building projects were cost-effective by each metric (0.4 years for the upper quartile and 2.4 years for the lower quartile), as were the majority of new-construction projects (1.5 years and 10.8 years, respectively). We also found high cost-effectiveness for each specific measure for which we have data. Contrary to a common perception, cost-effectiveness is often achieved even in smaller buildings. Thanks to energy savings valued more than the cost of the commissioning process, associated reductions in greenhouse gas emissions come at 'negative' cost. In fact, the median cost of conserved carbon is negative - -$110 per tonne for existing buildings and -$25/tonne for new construction - as compared with market prices for carbon trading and offsets in the +$10 to +$30/tonne range. Further enhancing the value of commissioning, its non-energy benefits surpass those of most other energy-management practices. Significant first-cost savings (e.g., through right-sizing of heating and cooling equipment) routinely offset at least a portion of commissioning costs - fully in some cases. When accounting for these benefits, the net median commissioning project cost was reduced by 49% on average, while in many cases they exceeded the direct value of the energy savings. Commissioning also improves worker comfort, mitigates indoor air quality problems, increases the competence of in-house staff, plus a host of other non-energy benefits. These findings demonstrate that commissioning is arguably the single-most cost-effective strategy for reducing energy, costs, and greenhouse gas emissions in buildings today. Energy savings tend to persist well over at least a 3- to 5-year timeframe, but data over longer time horizons are not available. It is thus important to 'Trust but Verify,' and indeed the field is moving towards a monitoring-based paradigm in which instrumentation is used not only to confirm savings, but to identify opportunities that would otherwise go undetected. On balance, we view the findings here as conservative, in the sense that they underestimate the actual performance of projects when all costs and benefits are considered. They underestimate the technical potential for a scenario in which best practices are applied.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Finite element analysis of steady and transiently moving/rolling nonlinear viscoelastic structure. II - Shell and three-dimensional simulations

In a three-part series of papers, a generalized finite element solution strategy is developed to handle traveling load problems in rolling, moving and rotating structure. The main thrust of this section consists of the development of three-dimensional and shell type moving elements. In conjunction with this work, a compatible three-dimensional contact strategy is also developed. Based on these modeling capabilities, extensive analytical and experimental benchmarking is presented. Such testing includes traveling loads in rotating structure as well as low- and high-speed rolling contact involving standing wave-type response behavior. These point to the excellent modeling capabilities of moving element strategies.

Kennedy, Ronald↗

Evaluating the Efficacy of the Cloud for Cluster Computation

Computing requirements vary by industry, and it follows that NASA and other research organizations have computing demands that fall outside the mainstream. While cloud computing made rapid inroads for tasks such as powering web applications, performance issues on highly distributed tasks hindered early adoption for scientific computation. One venture to address this problem is Nebula, NASA's homegrown cloud project tasked with delivering science-quality cloud computing resources. However, another industry development is Amazon's high-performance computing (HPC) instances on Elastic Cloud Compute (EC2) that promises improved performance for cluster computation. This paper presents results from a series of benchmarks run on Amazon EC2 and discusses the efficacy of current commercial cloud technology for running scientific applications across a cluster. In particular, a 240-core cluster of cloud instances achieved 2 TFLOPS on High-Performance Linpack (HPL) at 70% of theoretical computational performance. The cluster's local network also demonstrated sub-100 ?s inter-process latency with sustained inter-node throughput in excess of 8 Gbps. Beyond HPL, a real-world Hadoop image processing task from NASA's Lunar Mapping and Modeling Project (LMMP) was run on a 29 instance cluster to process lunar and Martian surface images with sizes on the order of tens of gigapixels. These results demonstrate that while not a rival of dedicated supercomputing clusters, commercial cloud technology is now a feasible option for moderately demanding scientific workloads.

Cloud Computing↗