Search NASA⌕ Search

SEARCH · Search NASA

Results for “software 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.

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

At least 235 records · Page 13

Optimizing Excited-State Electronic-Structure Codes for Intel Knights Landing: A Case Study on the BerkeleyGW Software

We profile and optimize calculations performed with the BerkeleyGW code on the Xeon-Phi architecture. BerkeleyGW depends both on hand-tuned critical kernels as well as on BLAS and FFT libraries. We describe the optimization process and performance improvements achieved. We discuss a layered parallelization strategy to take advantage of vector, thread and node-level parallelism. We discuss locality changes (including the consequence of the lack of L3 cache) and effective use of the on-package high-bandwidth memory. We show preliminary results on Knights-Landing including a roofline study of code performance before and after a number of optimizations. We find that the GW method is particularly well-suited for many-core architectures due to the ability to exploit a large amount of parallelism over plane-wave components, band-pairs, and frequencies.

97 MATHEMATICS AND COMPUTING↗

Software defined network inference with evolutionary optimal observation matrices

A key requirement for network management is the accurate and reliable monitoring of relevant network characteristics. In today's large-scale networks, this is a challenging task due to the scarcity of network measurement resources and the hard constraints that this imposes. Here, this paper proposes a new framework, called SNIPER, which leverages the flexibility provided by Software-Defined Networking (SDN) to design the optimal observation or measurement matrix that can lead to the best achievable estimation accuracy using Matrix Completion (MC) techniques. To cope with the complexity of designing large-scale optimal observation matrices, we use the Evolutionary Optimization Algorithms (EOA) which directly target the ultimate estimation accuracy as the optimization objective function. We evaluate the performance of SNIPER using both synthetic and real network measurement traces from different network topologies and by considering two main applications for per-flow size and delay estimations. Our results show that SNIPER can be applied to a variety of network performance measurements under hard resource constraints. For example, by measuring only 8.8% of all per-flow path delays in Harvard network [1], congested paths can be detected with probability of 0.94. Finally, to demonstrate the feasibility of our framework, we also have implemented a prototype of SNIPER in Mininet.

97 MATHEMATICS AND COMPUTING↗

Athena - Shuttle Bus Optimization and Event Driven Simulator [SWR 20-105]

The primary purpose of the software is to optimize shuttle routes to and from terminals, given some airport campus location like the rental car center. This code was developed as part of the DOE funded Athena project. One aspect of the Athena project was to investigate if the optimization of shuttle routes that move passengers to and from the five DFW terminals and the rental car center could result in lower energy consumption from the shuttle fleet while still maintaining an acceptable level of service to passengers. Hence, the optimization done by the code determines a set of shuttle routes, the type of shuttle on each route, and the number of shuttles servicing each route. The optimization aims to make these choices in a way that the energy consumption per hour by the fleet is minimized. Additionally, the software can fast simulate airport shuttle operations with collected data. The simulation inputs are passenger arrival rates, shuttle routes and frequencies, and simulation configurations. The outputs include: time dependent shuttle energy level, time dependent charging station usage, time dependent number of passengers on each bus, time dependent number of passengers at each bus stop, history of number of passengers left at each bus stop, route history of fleet shuttle buses and on-demand buses, and time dependent bus distance traveled.

Kelly, Kenneth↗

Powering Data Centers with Clean Energy: A Techno-Economic Case Study of Nuclear and Renewable Energy Dependability

Rising data demands from artificial intelligence (AI) and large language models (LLMs) generating images, videos, and text have prompted increased need for larger and more robust data centers in the United States. Major companies interested in these larger data centers face the choice of linking them to existing regional grids, building stand-alone power supplies onsite, or a combination of both. The request, review, and approval process for new transmission lines to grids in the United States, however, has grown in recent years to times spans rivaling those of new construction for nuclear power plants. Building an islanded power supply for each data center is therefore becoming a prominent option. In this case study, several technologies are modeled in techno-economic simulations for long-term system costs subject to fixed electricity demand from a singular data center. A 250 MWe data center is assumed with additional 50 MWe for resiliency. Techno-economic simulations are conducted using the Holistic Energy Resource Optimization Network (HERON) software, which is a part of the Framework for Optimization of Resources and Economics (FORCE) tool suite. Technologies considered include solar, wind, lithium-ion batteries, and several types of nuclear reactors: large-scale reactors, small modular reactors, and microreactors. A low- and high-cost estimate for each technology is assumed to develop a range of expected economic performance. Low-cost estimates included several clean energy production tax credits. Different combinations of renewable energy generators with nuclear reactors are considered, ranging from a fully renewable-powered data center to a fully nuclear-powered data center. Historic time series of wind and solar availability from the Texas grid are used to train a reduced order model; this model then generates unique time series with similar characteristics of the training dataset. Multiple scenarios of weather and subsequent operations are simulated for each renewable-nuclear combination to determine total costs throughout the project lifetime. Fully renewable-powered configurations required large amounts of installed capacity (GW scale) in the simulations to meet the fixed demand of the data center. This is due to some scenarios in the historical dataset which captured low-wind and low-solar days, requiring over-building of these technologies as well as batteries to compensate for the low amounts of electricity generation. Fully nuclear-powered configurations outperformed the fully renewable and mixed renewable-nuclear configurations in terms of cost, with ranges between $1B and $10B in 2023 USDs compared to $40B+ for fully renewable configurations. Of the nuclear technologies, small modular reactors performed better economically than large-scale nuclear models due to lower projected capital costs, and both performed better than the microreactor models. These results demonstrate the applicability of firm, dispatchable electricity resources from baseload generators like nuclear power plants for operating facilities that run at constant power without daily variability.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Diffusion bonding of commercially pure Ni using Cu interlayer

The concentration dependence of diffusivity in a multi-component diffusion system makes it complicated to predict the concentration profiles of diffusing species. This so called chemical diffusivity can be expressed as a function of thermodynamic and kinetic data. DICTRA software can calculate the concentration profiles using appropriate mobility and thermodynamic data. It can also optimize the diffusivity data using experimental diffusivity data. Then the optimized diffusivity data is stored as mobility data which is a linear function of temperature. In this work, diffusion bonding of commercially pure Ni using Cu interlayers is reported. The mobility parameters of Ni-Cu alloy binary systems were optimized using DICTRA/Thermocalc software from the available self-, tracer and chemical diffusion coefficients. The optimized mobility parameters were used to simulate concentration profiles of Ni-Cu diffusion joints using DICTRA/Thermocalc software. The calculated and experimental concentration profiles agreed well at 1100 Degree-Sign C. Agreement between the simulated and experimental profiles was less good at 1050 Degree-Sign C due to the grain boundary contribution to the overall diffusion. - Highlights: Black-Right-Pointing-Pointer The concentration profiles of Cu in Ni-Cu diffusion joints are modeled. Black-Right-Pointing-Pointer Interdiffusion coefficients in Ni-Cu system are optimized. Black-Right-Pointing-Pointer Optimized interdiffusion coefficients are expressed as mobility parameters. Black-Right-Pointing-Pointer Simulated profiles are comparable with experimental profiles.

36 MATERIALS SCIENCE↗

Tumor Volume Is Better Than Diameter for Predicting the Prognosis of Patients with Early-Stage Non-small Cell Lung Cancer

Background: This study aimed to investigate whether tumor volume (TV) is better than diameter for predicting the prognosis of patients with early-stage non-small cell lung cancer (NSCLC) after complete resection. Methods: This study retrospectively reviewed the clinicopathologic characteristics of 274 patients with early-stage NSCLC who had received pretreatment computed tomography (CT) scans and complete resection. TV was semi-automatically measured from CT scans using an imaging software program. The optimal cutoff of TV was determined by X-tile software. Disease-free survival (DFS) and overall survival (OS) were assessed by the Kaplan–Meier method. The prognostic significance of TV and other variables was assessed by Cox proportional hazards regression analysis. Results: Using 3.046 cm{sup 3} and 8.078 cm{sup 3} as optimal cutoff values of TV, the patients were separated into three groups. A larger TV was significantly associated with poor DFS and OS in the multivariable analysis. Kaplan–Meier curves of DFS and OS showed significant differences on the basis of TV among patients with stage 1a disease, greatest tumor diameter (GTD) of 2 cm or smaller, and GTD of 2–3 cm, respectively. Using two TV cutoff points, three categories of TV were created. In 54 cases (19.7%), patients migrated from the GTD categories of 2 cm or smaller, 2–3 cm, and larger than 3 cm into the TV categories of 3.046 cm{sup 3} or smaller, 3.046–8.078 cm{sup 3}, and larger than 8.078 cm{sup 3}. Conclusion: TV is an independent prognostic factor of DFS and OS for early-stage NSCLC. The findings show that TV is better than GTD for predicting the prognosis of patients with early-stage NSCLC.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗

Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

Source record↗

Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

Source record↗

Self Configuring Digital Twin for Optimizing E-Waste Recycling

Electronic waste recycling industry needs a decision support tool for optimizing their processes to become cost competitive. We developed a software called CMAT, Comprehensive Manufacturing Assessment Tool. The aim of CMAT is to provide the e-waste recycling companies with a fully customizable decision support framework that analyzes the optimal supply chain configurations. The software optimizes the logistics operations, helps to identify the best recycling process configuration, and generates valuable insights regarding the economic performance of different categories of e-waste. The ultimate purpose of the tool is to assist the users developing a digital twin of their processes and to provide insights on questions pertinent to the e-waste recycling industry including how to increase efficiency and reduce costs, energy consumption, and greenhouse gas emissions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A checkpoint compression study for high-performance computing systems

As high-performance computing systems continue to increase in size and complexity, higher failure rates and increased overheads for checkpoint/restart (CR) protocols have raised concerns about the practical viability of CR protocols for future systems. Previously, compression has proven to be a viable approach for reducing checkpoint data volumes and, thereby, reducing CR protocol overhead leading to improved application performance. In this article, we further explore compression-based CR optimization by exploring its baseline performance and scaling properties, evaluating whether improved compression algorithms might lead to even better application performance and comparing checkpoint compression against and alongside other software- and hardware-based optimizations. Our results highlights are: (1) compression is a very viable CR optimization; (2) generic, text-based compression algorithms appear to perform near optimally for checkpoint data compression and faster compression algorithms will not lead to better application performance; (3) compression-based optimizations fare well against and alongside other software-based optimizations; and (4) while hardware-based optimizations outperform software-based ones, they are not as cost effective.

97 MATHEMATICS AND COMPUTING↗

TU-AB-BRC-10: Modeling of Radiotherapy Linac Source Terms Using ARCHER Monte Carlo Code: Performance Comparison of GPU and MIC Computing Accelerators

Purpose: (1) To perform phase space (PS) based source modeling for Tomotherapy and Varian TrueBeam 6 MV Linacs, (2) to examine the accuracy and performance of the ARCHER Monte Carlo code on a heterogeneous computing platform with Many Integrated Core coprocessors (MIC, aka Xeon Phi) and GPUs, and (3) to explore the software micro-optimization methods. Methods: The patient-specific source of Tomotherapy and Varian TrueBeam Linacs was modeled using the PS approach. For the helical Tomotherapy case, the PS data were calculated in our previous study (Su et al. 2014 41(7) Medical Physics). For the single-view Varian TrueBeam case, we analytically derived them from the raw patient-independent PS data in IAEA’s database, partial geometry information of the jaw and MLC as well as the fluence map. The phantom was generated from DICOM images. The Monte Carlo simulation was performed by ARCHER-MIC and GPU codes, which were benchmarked against a modified parallel DPM code. Software micro-optimization was systematically conducted, and was focused on SIMD vectorization of tight for-loops and data prefetch, with the ultimate goal of increasing 512-bit register utilization and reducing memory access latency. Results: Dose calculation was performed for two clinical cases, a Tomotherapy-based prostate cancer treatment and a TrueBeam-based left breast treatment. ARCHER was verified against the DPM code. The statistical uncertainty of the dose to the PTV was less than 1%. Using double-precision, the total wall time of the multithreaded CPU code on a X5650 CPU was 339 seconds for the Tomotherapy case and 131 seconds for the TrueBeam, while on 3 5110P MICs it was reduced to 79 and 59 seconds, respectively. The single-precision GPU code on a K40 GPU took 45 seconds for the Tomotherapy dose calculation. Conclusion: We have extended ARCHER, the MIC and GPU-based Monte Carlo dose engine to Tomotherapy and Truebeam dose calculations.

60 APPLIED LIFE SCIENCES↗

Optimizing the Performance of Radionuclide Identification Software in the Hunt for Nuclear Security Threats

The Radionuclide Analysis Kit (RNAK), my team’s most recent nuclide identification software, is entering the testing phase. A question arises: will removing rare nuclides from the software’s library improve its overall performance? An affirmative response indicates fundamental errors in the software’s framework, while a negative response confirms the effectiveness of the software’s key machine learning algorithms. After thorough testing, I found that the performance of RNAK cannot be improved with the library choice effect, thus verifying the effectiveness of RNAK’s algorithms—multiple linear regression, Bayesian network using the Viterbi algorithm, and branch and bound search.

97 MATHEMATICS AND COMPUTING↗

Innovative Open-Source Energy Software to Drive and Enable Energy Savings and Process Optimization

U.S. Department of Energy (DOE) energy system-analysis software tools have been used for years helping to identify over 170 TBTU/year of energy savings through the Save Energy Now “Energy Savings Assessment” and Better Plants “In-Plant Training” Programs. While most of the fundamental energy savings opportunities do not evolve much with time, computer technology never stops, leaving most of these software tools inoperable on modern computers.This has sparked an initiative to revitalize the DOE energy system analysis tools into a new, open-source, integrated software tool suite - MEASUR. Designed for industrial energy coordinators, engineers, utility-program implementers and individuals who are interested in improving system efficiency, MEASUR can aide users in identifying, assessing, and quantifying energy savings opportunities within pump, fan, process heating, steam, motors, and compressed air systems. In addition, the software contains over 40 equipment and property calculators for simple energy-related calculations and analyses.This paper will present a results comparison for each energy-consuming system using data from past DOE-sponsored energy assessments (to establish the accuracy of the savings algorithms) to validate and verify the accuracy of the energy and cost savings calculated by MEASUR. Additionally, an example highlighting 3rd-party development of the tool’s opensource framework into real-time sensor systems and efficiency-optimization will be presented.

Armstrong, Kristina↗

EMOS (Energy Management Optimization System) [SWR-21-46]

EMOS software performs a real-time hierarchal optimal control for energy systems like multi-port electric vehicles charging site with distributed energy resources (DERs) and energy storage systems (ESSs). It gathers information in real-time from electric vehicles, power grid, and DERs, solves a multi-objective energy management optimization problem, and output setpoint for chargers, ESS converters, DERs converters, and grid converters. The software incorporates a novel integration of two control tasks: a) An Energy Management Optimization (EMO), which is the brain of EMOS controller that gathers information in real-time from EVs [e.g., battery size, state-of-charge (SOC), desired SOC, and charge acceptance curve], grid (e.g., electricity price, allowed feeder capacity, ramp rate limit, and reactive power), and DERs (e.g., prediction for solar generation for PV systems). It solves a control optimization problem in real-time to find optimal setpoint for ESSs power dispatch, EVs charging rate, and grid inverters. The objectives are to (1) minimize the charging cost considering grid energy, demand charges, and battery energy, (2) minimize charging time to meet fast charging criterion, (3) keep high energy level on ESSs at the end of an operating period, while satisfying constraints related to grid, EVs, and power converters. b) Real-Time Energy Management System (RT-EMS) is a rule-based algorithm that has faster response than EMO. It receives optimal setpoint from EMO and actual measurements from the system and modify the setpoint to compensate for any fast disturbance in the system, until a new optimum solution is received. Fast disturbances may include vehicle connect/disconnect, unpredicted variation in DERs profiles, variation in grid voltage, errors in PV generation prediction, and others. In addition, RT-EMS regulates voltage at point of common coupling (PCC) by managing reactive power of grid converters.

Mohamed, Ahmed↗

The CPAT 2.0.2 Domain Model - How CPAT 2.0.2 "Thinks" From an Analyst Perspective.

To help effectively plan the management and modernization of their large and diverse fleets of vehicles, the Program Executive Office Ground Combat Systems (PEO GCS) and the Program Executive Office Combat Support and Combat Service Support (PEO CS &CSS) commissioned the development of a large - scale portfolio planning optimization tool. This software, the Capability Portfolio Analysis Tool (CPAT), creates a detailed schedule that optimally prioritizes the modernization or replacement of vehicles within the fleet - respecting numerous business rules associated with fleet structure, budgets, industrial base, research and testing, etc., while maximizing overall fleet performance through time. This report contains a description of the organizational fleet structure and a thorough explanation of the business rules that the CPAT formulation follows involving performance, scheduling, production, and budgets. This report, which is an update to the original CPAT domain model published in 2015 (SAND2015 - 4009), covers important new CPAT features. This page intentionally left blank

97 MATHEMATICS AND COMPUTING↗