Search NASA⌕ Search

SEARCH · Search NASA

Results for “allocation methods”

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 271 records · Page 15

Echo™ User Manual

Echo™ is a MATLAB-based software package designed for robust and scalable analysis of complex data workflows. An alternative to tedious, error-prone conventional processes, Echo is based on three transformative principles for data analysis: self-describing data, name-based indexing, and dynamic resource allocation. The software takes an object-oriented approach to data analysis, intimately connecting measurement data with associated metadata. Echo operations in an analysis workflow automatically track and merge metadata and computation parameters to provide a complete history of the process used to generate final results, while automated figure and report generation tools eliminate the potential to mislabel those results. History reporting and visualization methods provide straightforward auditability of analysis processes. Furthermore, name-based indexing on metadata greatly improves code readability for analyst collaboration and reduces opportunities for errors to occur. Echo efficiently manages large data sets using a framework that seamlessly allocates resources such that only the necessary computations to produce a given result are executed. Echo provides a versatile and extensible framework, allowing advanced users to add their own tools and data classes tailored to their own specific needs. Applying these transformative principles and powerful features, Echo greatly improves analyst efficiency and quality of results in many application areas.

97 MATHEMATICS AND COMPUTING↗

Critical interpretation of CH– and OH– stretching regions for infrared spectra of methanol clusters (CH{sub 3}OH){sub n} (n = 2–5) using self-consistent-charge density functional tight-binding molecular dynamics simulations

Vibrational infrared (IR) spectra of gas-phase O–H⋅⋅⋅O methanol clusters up to pentamer are simulated using self-consistent-charge density functional tight-binding method using two distinct methodologies: standard normal mode analysis and Fourier transform of the dipole time-correlation function. The twofold simulations aim at the direct critical assignment of the C–H stretching region of the recently recorded experimental spectra [H.-L. Han, C. Camacho, H. A. Witek, and Y.-P. Lee, J. Chem. Phys. 134, 144309 (2011)]. Both approaches confirm the previous assignment (ibid.) of the C–H stretching bands based on the B3LYP/ANO1 harmonic frequencies, showing that ν{sub 3}, ν{sub 9}, and ν{sub 2} C–H stretching modes of the proton-accepting (PA) and proton-donating (PD) methanol monomers experience only small splittings upon the cluster formation. This finding is in sharp discord with the assignment based on anharmonic B3LYP/VPT2/ANO1 vibrational frequencies (ibid.), suggesting that some procedural faults, likely related to the breakdown of the perturbational vibrational treatment, led the anharmonic calculations astray. The IR spectra based on the Fourier transform of the dipole time-correlation function include new, previously unaccounted for physical factors such as non-zero temperature of the system and large amplitude motions of the clusters. The elevation of temperature results in a considerable non-homogeneous broadening of the observed IR signals, while the presence of large-amplitude motions (methyl group rotations and PA-PD flipping), somewhat surprisingly, does not introduce any new features in the spectrum.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Cation Uptake and Allocation by Red Pine Seedlings under Cation-Nutrient Stress in a Column Growth Experiment

Background and Aims Plant nutrient uptake is affected by environmental stress, but how plants respond to cation-nutrient stress is poorly understood. We assessed the impact of varying degrees of cation-nutrient limitation on cation uptake in an experimental plant-mineral system. Methods Column experiments, with red pine (Pinus resinosa Ait.) seedlings growing in sand/mineral mixtures, were conducted for up to nine months under a range of Ca- and K-limited conditions. The Ca and K were supplied from both minerals and nutrient solutions with varying Ca and K concentrations. Results Cation nutrient stress had little impact on carbon allocation after nine months of plant growth and K was the limiting nutrient for biomass production. The Ca/Sr and K/Rb ratio results allowed independent estimation of dissolution incongruency and discrimination against Sr and Rb during cation uptake processes. The fraction of K in biomass from biotite increased with decreasing K supply from nutrient solutions. The mineral anorthite was consistently the major source of Ca, regardless of nutrient treatment. Conclusions Red pine seedlings exploited more mineral K in response to more severe K deficiency. This did not occur for Ca. Plant discrimination factors must be carefully considered to accurately identify nutrient sources using cation tracers.

Cation-nutrient stress↗

Dynamic Interference Management for UAV-Assisted Wireless Networks

Here, we investigate a transmission mechanism aiming to improve the data rate between a base station (BS) and a user equipment (UE) through deploying multiple relaying UAVs. We consider the effect of interference incurred by another established communication network, which makes our problem challenging and different from the state of the art. We aim to design the 3D trajectories and power allocation for the UAVs to maximize the data flow of the network while keeping the interference on the existing communication network below a threshold. We utilize the mobility feature of the UAVs to evade the (un)-intended interference caused by (un)-intentional interferers. To this end, we propose an alternating-maximization approach to jointly obtain the 3D trajectories and the UAVs transmission powers. We handle the 3D trajectory design by resorting to spectral graph the power allocation through convex optimization techniques. We also approach the problem from the intentional interferer’s perspective where smart jammers chase the UAVs to effectively degrade the data flow of the network. We also extend our work to the case for multiple UEs. Finally, we demonstrate the efficacy of our proposed method through extensive simulations.

42 ENGINEERING↗

Global and regional potential for bioenergy from agricultural and forestry residue biomass

As co-products, agricultural and forestry residues represent a potential low cost, low carbon, source for bioenergy. A method is developed method for estimating the maximum sustainable amount of energy potentially available from agricultural and forestry residues by converting crop production statistics into associated residue, while allocating some of this resource to remain on the field to mitigate erosion and maintain soil nutrients. Currently, we estimate that the world produces residue biomass that could be sustainably harvested and converted into over 50 EJ yr-1 of energy. The top three countries where this resource is estimated to be most abundant are currently net energy importers: China, the United States (US), and India. The global potential from residue biomass is estimated to increase to approximately 80-95 EJ yr-1 by mid- to late- century, depending on physical assumptions such as of future crop yields and the amount of residue sustainably harvestable. The future market for biomass residues was simulated using the Object-Oriented Energy, Climate, and Technology Systems Mini Climate Assessment Model (ObjECTS MiniCAM). Utilization of residue biomass as an energy source is projected for the next century under different climate policy scenarios. Total global use of residue biomass is estimated to increase to 70-100 EJ yr-1 by mid- to late- century in a central case, depending on the presence of a climate policy and the economics of harvesting, aggregating, and transporting residue. Much of this potential is in developing regions of the world, including China, Latin America, Southeast Asia, and India.

09 BIOMASS FUELS↗

Centroidal Voronoi tessellation based methods for optimal rain gauge location prediction

With more satellite and model precipitation data becoming available, new analytical methods are needed that can take advantage of emerging data patterns to make well informed predictions in many hydrological applications. Herein we propose a new strategy where we extract precipitation variability patterns and use correlation map to build the resulting density map that serves as an input to centroidal Voronoi tessellation construction that optimizes placement of precipitation gauges. We provide results of numerical experiments based on the data from the Alto-Adige region in Northern Italy and Oklahoma and compare them against actual gauge locations. This method provides an automated way for choosing new gauge locations and can be generalized to include physical constraints and to tackle other types of resource allocation problems.

54 ENVIRONMENTAL SCIENCES↗

Exploring the feasibility of lossy compression for PDE simulations

Checkpoint restart plays an important role in high-performance computing (HPC) applications, allowing simulation runtime to extend beyond a single job allocation and facilitating recovery from hardware failure. Yet, as machines grow in size and in complexity, traditional approaches to checkpoint restart are becoming prohibitive. Current methods store a subset of the application’s state and exploit the memory hierarchy in the machine. However, as the energy cost of data movement continues to dominate, further reductions in checkpoint size are needed. Lossy compression, which can significantly reduce checkpoint sizes, offers a potential to reduce computational cost in checkpoint restart. This article investigates the use of numerical properties of partial differential equation (PDE) simulations, such as bounds on the truncation error, to evaluate the feasibility of using lossy compression in checkpointing PDE simulations. Restart from a checkpoint with lossy compression is considered for a fail-stop error in two time-dependent HPC application codes: PlasComCM and Nek5000. Results show that error in application variables due to a restart from a lossy compressed checkpoint can be masked by the numerical error in the discretization, leading to increased efficiency in checkpoint restart without influencing overall accuracy in the simulation.

97 MATHEMATICS AND COMPUTING↗

Method of data communications with reduced latency

Data communications with reduced latency, including: writing, by a producer, a descriptor and message data into at least two descriptor slots of a descriptor buffer, the descriptor buffer comprising allocated computer memory segmented into descriptor slots, each descriptor slot having a fixed size, the descriptor buffer having a header pointer that identifies a next descriptor slot to be processed by a DMA controller, the descriptor buffer having a tail pointer that identifies a descriptor slot for entry of a next descriptor in the descriptor buffer; recording, by the producer, in the descriptor a value signifying that message data has been written into descriptor slots; and setting, by the producer, in dependence upon the recorded value, a tail pointer to point to a next open descriptor slot.

97 MATHEMATICS AND COMPUTING↗

Thriving in the Carbon-Aware Market: How to Account for Emissions in the Era of Carbon-Centered Trade Policies

Emerging global policies, such as the European Union's enacted Carbon Border Adjustment Mechanism and similar policies under development in Canada, Australia and the United Kingdom, will place a premium on goods traded into their territories with higher embedded emissions than those produced domestically. U.S. manufacturers could stand to benefit from such policies; given the investments U.S. industry has made to reduce the energy and emission intensities of its operations. For example, the overall GHG intensity of U.S. steel production in 2019 was ~0.96 t CO2/t steel, less than half that of China (~1.97 t CO2/t steel), and bested only by Italy. To realize these benefits, transparent, accurate, interoperable and accepted embedded emissions accounting and calculation methods are required. Achieving this requires overcoming challenges related to data availability, boundary definitions, and product definitions among others, both at individual facilities as well as through value chains. We will present technical findings on methodology considerations and data-availability constraints for determining the emissions of traded goods, using steel as a pilot and leveraging publicly available data. Issues such as determining the appropriate scope for emissions accounting, implications of the specificity of product chosen, emissions allocation in multi-product facilities, and enumeration of emissions for products manufactured across multiple facilities will be discussed. By sharing the results of our efforts, we aim to inform the development and execution of embedded emissions accounting methods from a technical perspective such that U.S. manufacturers can thrive in emerging global markets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Towards Precision Photometric Type ia Supernova Cosmology With Machine Learning

The revolutionary discovery of dark energy and accelerating cosmic expansion was made with just 42 type Ia supernovae (SNe Ia) in 1999. Since then, large synoptic surveys, e.g., Dark Energy Survey (DES), have observed thousands more SNe Ia and the upcoming Rubin Legacy Survey of Space and Time (LSST) and Roman Space Telescope promise to deliver millions in the next decade. This unprecedented data volume can produce the required precision to unambiguously test concordance cosmology which could represent a monumental shift in our understanding of dark energy and its role in cosmic history. However, extracting a pure SN Ia sample with accurate redshifts for such a large dataset will be a challenge. Specifically, spectroscopic classification will not be possible for the vast majority of discovered objects, and only ~25% will have spectroscopic redshifts. This thesis presents a series of observational and methodological studies designed to address the questions associated with this new era of photometric SN Ia cosmology. First, we present a machine learning method for photometric classification of SNe, Supernova Classification with a COnvolutional Neural Network (SCONE). Photometric classification enables SNe with no spectroscopic information to be confidently categorized, and is a critical component of current and future analysis pipelines. SCONE achieves >99% accuracy distinguishing simulated SNe Ia from non-Ia SNe, and has been integrated into DES, LSST, and Roman analysis pipelines. We also demonstrate the efficacy of SCONE on early-time photometric classification, which will be vital for optimal allocation of spectroscopic resources. We show that SCONE can distinguish between 6 SN types with 75% accuracy on the night of initial discovery, comparable to results in the literature for full-phase SNe. Next, we study current methods for estimating SN Ia redshifts and propose a machine learning alternative that uses SN photometry alone to extract redshift information. Most SNe Ia inherit redshift information from their host galaxy, but the process of matching SNe to the correct host galaxy can be challenging. We systematically analyze the impact of incorrect redshifts from host galaxy mismatch on 5 years of DES SN data, and conclude that improved host matching or redshift estimation methods can reduce our systematic errors by ~10%. In response to this finding, we present a SN photometry-only method for estimating redshifts independent of host galaxy information, Photo-zSNthesis. We show that Photo-zSNthesis redshift estimates are accurate to within 2% across the full redshift range of LSST, a first in the literature. Finally, we focus on the robustness of machine learning (ML) algorithms for real-world and scientific applications. ML models generalize poorly beyond their training set and often experience severe performance degradation when deployed on new data. We demonstrate a general method for improving robustness that achieves new state-of-the-art results on astronomical object classification, wildlife identification, and tumor detection.

79 ASTRONOMY AND ASTROPHYSICS↗

Method, apparatus and system for managing queue operations of a test bench environment

Techniques and mechanisms for performing dequeue operations for agents of a test bench environment. In an embodiment, a first group of agents are each allocated a respective ripe reservation and a second set of agents are each allocated a respective unripe reservation. Over time, queue management logic allocates respective reservations to agents and variously changes one or more such reservations from unripe to ripe. In another embodiment, an order of servicing agents allocated unripe reservations is based on relative priorities of the unripe reservations with respect to one another. An order of servicing agents allocated ripe reservations is on a first come, first served basis.

97 MATHEMATICS AND COMPUTING↗

Clinical Implications of the Tumor Volume Reduction Rate in Head-and-Neck Cancer During Definitive Intensity-Modulated Radiotherapy for Organ Preservation

Purpose: To investigate the prognostic value of the volume reduction rate (VRR) in patients with head-and-neck cancer treated with intensity-modulated radiotherapy (IMRT). Methods and Materials: Seventy-six patients with oropharyngeal cancer (OPC) and another 76 with hypopharyngeal cancer (HPC) were enrolled in volumetric analysis. All patients received allocated radiotherapy courses. Adaptive computed tomography was done 4 to 5 weeks after the start of IMRT. Primary tumor volume measurement was derived using separate images for the pretreatment gross tumor volume (pGTV) and the interval gross tumor volume. Results: In the OPC group, the pGTV ranged from 6.6 to 242.6 mL (mean, 49.9 mL), whereas the value of the VRR ranged from 0.014 to 0.74 (mean, 0.43). In HPC patients, the pGTV ranged from 4.1 to 152.4 mL (mean, 35.6 mL), whereas the VRR ranged from -1.15 to 0.79 (mean, 0.33). Multivariate analysis of the primary tumor relapse-free survival for OPC revealed three prognostic factors: T4 tumor (p = 0.0001, hazard ratio 7.38), pGTV {>=}20 mL (p = 0.01, hazard ratio 10.61), and VRR <0.5 (p = 0.001, hazard ratio 6.49). Multivariate analysis of the primary tumor relapse-free survival for HPC showed two prognostic factors: pGTV {>=}30 mL (p = 0.001, hazard ratio 2.87) and VRR <0.5 (p = 0.03, hazard ratio 2.25). Conclusion: The VRR is an outcome predictor for local control in OPC and HPC patients treated with IMRT. Those with large tumor volumes or a VRR <0.5 should be considered for a salvage operation or a dose-escalation scheme.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Co-scheduling Ensembles of In Situ Workflows

Molecular dynamics (MD) simulations are widely used to study large-scale molecular systems. HPC systems are ideal platforms to run these studies, however, reaching the necessary simulation timescale to detect rare processes is challenging, even with modern supercomputers. To overcome the timescale limitation, the simulation of a long MD trajectory is replaced by multiple short-range simulations that are executed simultaneously in an ensemble of simulations. Analyses are usually co-scheduled with these simulations to efficiently process large volumes of data generated by the simulations at runtime, thanks to in situ techniques. Executing a workflow ensemble of simulations and their in situ analyses requires efficient co- scheduling strategies and sophisticated management of computational resources so that they are not slowing down each other. In this paper, we propose an efficient method to co-schedule simulations and in situ analyses such that the makespan of the workflow ensemble is minimized. We present a novel approach to allocate resources for a workflow ensemble under resource constraints by using a theoretical framework modeling the workflow ensemble’s execution. We evaluate the proposed approach using an accurate simulator based on the WRENCH simulation framework on various workflow ensemble configurations. Results demonstrate the significance of co-scheduling simulations and in situ analyses that couple data together to benefit from data locality, in which inefficient scheduling decisions can lead to slowdown in makespan up to a factor of 30.

Do, Tu Mai Anh↗

Portable, heterogeneous ensemble workflows at scale using libEnsemble

libEnsemble is a Python-based toolkit for running dynamic ensembles, developed as part of the DOE Exascale Computing Project. The toolkit utilizes a unique generator–simulator–allocator paradigm, where generators produce input for simulators, simulators evaluate those inputs, and allocators decide whether and when a simulator or generator should be called. The generator steers the ensemble based on simulation results. Generators may, for example, apply methods for numerical optimization, machine learning, or statistical calibration. libEnsemble communicates between a manager and workers. Flexibility is provided through multiple manager–worker communication substrates each of which has different benefits. These include Python’s multiprocessing, mpi4py, and TCP. Multisite ensembles are supported using Balsam or Globus Compute. We overview the unique characteristics of libEnsemble as well as current and potential interoperability with other packages in the workflow ecosystem. We highlight libEnsemble’s dynamic resource features: libEnsemble can detect system resources, such as available nodes, cores, and GPUs, and assign these in a portable way. These features allow users to specify the number of processors and GPUs required for each simulation; and resources will be automatically assigned on a wide range of systems, including Frontier, Aurora, and Perlmutter. Such ensembles can include multiple simulation types, some using GPUs and others using only CPUs, sharing nodes for maximum efficiency. We also describe the benefits of libEnsemble’s generator–simulator coupling, which easily exposes to the user the ability to cancel, and portably kill, running simulations based on models that are updated with intermediate simulation output. We demonstrate libEnsemble’s capabilities, scalability, and scientific impact via a Gaussian process surrogate training problem for the longitudinal density profile at the exit of a plasma accelerator stage. In conclusion, the study uses gpCAM for the surrogate model and employs either Wake-T or WarpX simulations, highlighting efficient use of resources that can easily extend to exascale.

Dynamic ensembles↗

Assessing and Reducing Miscellaneous Electric Loads (MELs) in Banks

Miscellaneous electric loads (MELs) are loads outside of a building's core functions of heating, ventilating, air conditioning, lighting, and water heating. MELs are a large percentage of total building energy loads. This report reviews methods for reducing MELs in Banks. Reducing MELs in a bank setting requires both local and corporate action. Corporate action centers on activities to prioritize and allocate the right resources to correct procurement and central control issues. Local action includes branch assessment or audits to identify specific loads and needs. The worksheet at the end of this guide can help with cataloging needed information and estimating savings potential. The following steps provide a guide to MEL reductions in Bank Branches. The general process has been adapted from a process developed for office buildings the National Renewable Energy Laboratory (NREL, 2011).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Exascale Monte Carlo R&D [Slides]

Overview of this presentation is (1) Exascale computing - different technologies, getting there; (2) high-performance proof-of-concept MCMini - features and results; and (3) OpenCL toolkit - Oatmeal (OpenCL Automatic Memory Allocation Library) - purpose and features. Despite driver issues, OpenCL seems like a good, hardware agnostic tool. MCMini demonstrates the possibility for GPGPU-based Monte Carlo methods - it shows great scaling for HPC application and algorithmic equivalence. Oatmeal provides a flexible framework to aid in the development of scientific OpenCL codes.

97 MATHEMATICS AND COMPUTING↗

Steps toward fault-tolerant quantum chemistry.

Developing quantum chemistry programs on the coming generation of exascale computers will be a difficult task. The programs will need to be fault-tolerant and minimize the use of global operations. This work explores the use a task-based model that uses a data-centric approach to allocate work to different processes as it applies to quantum chemistry. After introducing the key problems that appear when trying to parallelize a complicated quantum chemistry method such as coupled-cluster theory, we discuss the implications of that model as it pertains to the computational kernel of a coupled-cluster program - matrix multiplication. Also, we discuss the extensions that would required to build a full coupled-cluster program using the task-based model. Current programming models for high-performance computing are fault-intolerant and use global operations. Those properties are unsustainable as computers scale to millions of CPUs; instead one must recognize that these systems will be hierarchical in structure, prone to constant faults, and global operations will be infeasible. The FAST-OS HARE project is introducing a scale-free computing model to address these issues. This model is hierarchical and fault-tolerant by design, allows for the clean overlap of computation and communication, reducing the network load, does not require checkpointing, and avoids the complexity of many HPC runtimes. Development of an algorithm within this model requires a change in focus from imperative programming to a data-centric approach. Quantum chemistry (QC) algorithms, in particular electronic structure methods, are an ideal test bed for this computing model. These methods describe the distribution of electrons in a molecule, which determine the properties of the molecule. The computational cost of these methods is high, scaling quartically or higher in the size of the molecule, which is why QC applications are major users of HPC resources. The complexity of these algorithms means that MPI alone is insufficient to achieve parallel scaling; QC developers have been forced to use alternative approaches to achieve scalability and would be receptive to radical shifts in the programming paradigm. Initial work in adapting the simplest QC method, Hartree-Fock, to this the new programming model indicates that the approach is beneficial for QC applications. However, the advantages to being able to scale to exascale computers are greatest for the computationally most expensive algorithms; within QC these are the high-accuracy coupled-cluster (CC) methods. Parallel coupledcluster programs are available, however they are based on the conventional MPI paradigm. Much of the effort is spent handling the complicated data dependencies between the various processors, especially as the size of the problem becomes large. The current paradigm will not survive the move to exascale computers. Here we discuss the initial steps toward designing and implementing a CC method within this model. First, we introduce the general concepts behind a CC method, focusing on the aspects that make these methods difficult to parallelize with conventional techniques. Then we outline what is the computational core of the CC method - a matrix multiply - within the task-based approach that the FAST-OS project is designed to take advantage of. Finally we outline the general setup to implement the simplest CC method in this model, linearized CC doubles (LinCC).

99 GENERAL AND MISCELLANEOUS↗

Optimizing resource allocation in Miscanthus breeding via sparse testing designs for genomic prediction

Phenotyping high-biomass perennial crops is laborious and the rate of genetic gain in conventional perennial crop breeding programs is typically low. So, it is especially important to identify methods that produce efficiency gains in the breeding process. Miscanthus is a C4 perennial grass with favorable characteristics for producing biomass as a feedstock for biofuels and diverse bio-based products. Increasing biomass yield will increase profitability and environmental benefits, so it is a key target for Miscanthus breeding. In addition, the identification of well-adapted genotypes across a wide range of environmental conditions requires the establishment of multi-environment trials (METs). Sparse testing is a genomic prediction-based strategy that reduces the phenotyping costs in METs by selecting a subset of genotypes to evaluate in a subset of environments and then predicts the performance of the unobserved genotype-environment combinations. A Miscanthus sacchariflorus (MSA) population comprising 336 genotypes observed across three environments was analyzed implementing sparse testing designs. Three prediction models considering main effects (environments, genotypes, genomic) and interaction effects (genotype-by-environment; G×E interaction) were implemented for forecasting dry biomass yield (YDY), total culm (TCM), average internode length (AIL), and culm node number (CNN). Multiple calibration sets based on different compositions and sizes were considered to evaluate performance in terms of the predictive ability (PA) and the mean square error (MSE) for a fixed testing set size. The training set size ranged from 52 to 112 to predict a fixed set of 224 unobserved genotypes across all three environments. The results showed that the model accounting for G×E interaction consistently presented the highest PA and the lowest MSE: for CNN (PA: ~0.77, MSE: ~0.5) and YDY (PA: ~0.70, MSE: ~1.3) while for TCM and AIL these ranged from ~0.28 to 0.41 and ~1.3 to 4.3, respectively. Overall, varying training sets and allocation strategies did not affect PA and MSE, with 52 non-overlapping and 0 overlapping genotypes per environment as the optimal cost-effective allocation framework. This suggests that implementing sparse testing designs could significantly reduce phenotyping costs by fivefold, without compromising PA in breeding programs for perennial crops such as Miscanthus.

Miscanthus sacchariflorus (MSA)↗