Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Allocation”

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 307 records · Page 17

PROBABILISTIC CROSS-IDENTIFICATION IN CROWDED FIELDS AS AN ASSIGNMENT PROBLEM

One of the outstanding challenges of cross-identification is multiplicity: detections in crowded regions of the sky are often linked to more than one candidate associations of similar likelihoods. We map the resulting maximum likelihood partitioning to the fundamental assignment problem of discrete mathematics and efficiently solve the two-way catalog-level matching in the realm of combinatorial optimization using the so-called Hungarian algorithm. We introduce the method, demonstrate its performance in a mock universe where the true associations are known, and discuss the applicability of the new procedure to large surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

mdtmFTP and its evaluation on ESNET SDN testbed

In this paper, to address the high-performance challenges of data transfer in the big data era, we are developing and implementing mdtmFTP: a high-performance data transfer tool for big data. mdtmFTP has four salient features. First, it adopts an I/O centric architecture to execute data transfer tasks. Second, it more efficiently utilizes the underlying multicore platform through optimized thread scheduling. Third, it implements a large virtual file mechanism to address the lots-of-small-files (LOSF) problem. In conclusion, mdtmFTP integrates multiple optimization mechanisms, including–zero copy, asynchronous I/O, pipelining, batch processing, and pre-allocated buffer pools–to enhance performance. mdtmFTP has been extensively tested and evaluated within the ESNET 100G testbed. Evaluations show that mdtmFTP can achieve higher performance than existing data transfer tools, such as GridFTP, FDT, and BBCP.

97 MATHEMATICS AND COMPUTING↗

Modeling perennial bioenergy crops in the E3SM land model (ELMv2)

Perennial bioenergy crops are increasingly important for the production of ethanol and other renewable fuels, and as part of an agricultural system that alters the climate through its impact on biogeophysical and biogeochemical properties of the terrestrial ecosystem. Few earth system models (ESMs) represent such crops, however. In this study, we expand the Energy Exascale Earth System Model (E3SM) Land Model (ELMv2) to include perennial bioenergy crops with a high potential for mitigating climate change. We focus on high-productivity miscanthus and switchgrass, estimating various parameters associated with their different growth stages and performing a global sensitivity analysis to identify and optimize these parameters. The sensitivity analysis identifies five parameters associated with phenology, carbon/nitrogen allocation, stomatal conductance, and maintenance respiration as the most sensitive parameters for carbon and energy fluxes. We calibrated and validated the model against observations and found that the model closely captures the observed seasonality and the magnitude of carbon fluxes. The validated model represents the latent heat flux fairly well, but sensible heat flux for miscanthus is not well captured. Finally, we validated the model against observed leaf area index (LAI) and harvest amount and found modeled LAI captured observed seasonality , although the model underestimates LAI and harvest amount. This work provides a foundation for future ESM analyses of the interactions between perennial bioenergy crops and carbon, water, and energy dynamics in the larger earth system, and sets the stage for studying the impact of future biofuel expansion on climate and terrestrial systems.

09 BIOMASS FUELS↗

Multi-core processing and scheduling performance in CMS

Commodity hardware is going many-core. We might soon not be able to satisfy the job memory needs per core in the current single-core processing model in High Energy Physics. In addition, an ever increasing number of independent and incoherent jobs running on the same physical hardware not sharing resources might significantly affect processing performance. It will be essential to effectively utilize the multi-core architecture. CMS has incorporated support for multi-core processing in the event processing framework and the workload management system. Multi-core processing jobs share common data in memory, such us the code libraries, detector geometry and conditions data, resulting in a much lower memory usage than standard single-core independent jobs. Exploiting this new processing model requires a new model in computing resource allocation, departing from the standard single-core allocation for a job. The experiment job management system needs to have control over a larger quantum of resource since multi-core aware jobs require the scheduling of multiples cores simultaneously. CMS is exploring the approach of using whole nodes as unit in the workload management system where all cores of a node are allocated to a multi-core job. Whole-node scheduling allows for optimization of the data/workflow management (e.g. I/O caching, local merging) but efficient utilization of all scheduled cores is challenging. Dedicated whole-node queues have been setup at all Tier-1 centers for exploring multi-core processing workflows in CMS. We present the evaluation of the performance scheduling and executing multi-core workflows in whole-node queues compared to the standard single-core processing workflows.

Hernandez, J. M.↗

Estimating returns to scale and scale efficiency for energy consuming appliances

Energy consuming appliances accounted for over 40% of the energy use and $17 billion in sales in the U.S. in 2014. Whether such amounts of money and energy were optimally combined to produce household energy services is not straightforwardly determined. The efficient allocation of capital and energy to provide an energy service has been previously approached, and solved with Data Envelopment Analysis (DEA) under constant returns to scale. That approach, however, lacks the scale dimension of the problem and may restrict the economic efficient models of an appliance available in the market when constant returns to scale does not hold. We expand on that approach to estimate returns to scale for energy using appliances. We further calculate DEA scale efficiency scores for the technically efficient models that comprise the economic efficient frontier of the energy service delivered, under different assumptions of returns to scale. We then apply this approach to evaluate dishwashers available in the market in the U.S. Our results show that (a) for the case of dishwashers scale matters, and (b) the dishwashing energy service is delivered under non-decreasing returns to scale. The results further demonstrate that this method contributes to increase consumers’ choice of appliances.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Assessment of Potential Pennycress Availability and Suitable Sites for Sustainable Aviation Fuel Refineries in Ohio

Pennycress grain has a relatively high oil content (25–36%) and it is considered a desirable feedstock to produce sustainable aviation fuel (SAF). Pennycress crop can be integrated into the corn–soybean rotation as a winter cover crop in the midwestern U.S. to provide both ecosystem services and economic benefits for the farmers, while serving as a promising feedstock for SAF production. For pennycress-based SAF biorefineries to be established at the commercial scale, a sustainable design of the supply system is required to provide reliable information on feedstock availability and optimal facility locations. The objectives of this research were to assess the pennycress production potential in Ohio, and to identify the best locations to establish the SAF biorefineries. To estimate the pennycress production potential in Ohio, a geographic information system (GIS)-based model was developed using the spatially explicit six-year historical data on areas that were planted in the corn–soybean rotation for the period of 2013 through 2018, pennycress yield estimates from field-based experiments reported in the literature, and the soil productivity index for the region of study. Optimal SAF biorefinery locations were identified using a GIS-based location-allocation model. Annual land potentially available for pennycress production in Ohio was estimated to be ~0.6 million ha, which could produce ~1.1 million metric tons of pennycress grain as feedstock to produce ~210 million liters of SAF, depending on the pennycress yield level, oil content, and conversion efficiencies. In addition, the optimum locations for 12 biorefineries, each at an annual capacity of 18.9 million liters of SAF, were identified, and the average transportation distance was estimated to be 35 and 58 km for maximizing attendance and coverage conditions, respectively. The outcomes of this research would help minimize the risks associated with feedstock supply and cost variabilities for pennycress-based SAF production in the region.

Mousavi-Avval, Seyed Hashem↗

The SDSS-IV MaNGA Sample: Design, Optimization, and Usage Considerations

We describe the sample design for the SDSS-IV MaNGA survey and present the final properties of the main samples along with important considerations for using these samples for science. Our target selection criteria were developed while simultaneously optimizing the size distribution of the MaNGA integral field units (IFUs), the IFU allocation strategy, and the target density to produce a survey defined in terms of maximizing signal-to-noise ratio, spatial resolution, and sample size. Our selection strategy makes use of redshift limits that only depend on i-band absolute magnitude (M {sub i}), or, for a small subset of our sample, M {sub i} and color (NUV − i). Such a strategy ensures that all galaxies span the same range in angular size irrespective of luminosity and are therefore covered evenly by the adopted range of IFU sizes. We define three samples: the Primary and Secondary samples are selected to have a flat number density with respect to M {sub i} and are targeted to have spectroscopic coverage to 1.5 and 2.5 effective radii (R {sub e}), respectively. The Color-Enhanced supplement increases the number of galaxies in the low-density regions of color–magnitude space by extending the redshift limits of the Primary sample in the appropriate color bins. The samples cover the stellar mass range 5×10{sup 8}⩽M{sub ∗}⩽3×10{sup 11} M{sub ⊙} h{sup −2} and are sampled at median physical resolutions of 1.37 and 2.5 kpc for the Primary and Secondary samples, respectively. We provide weights that will statistically correct for our luminosity and color-dependent selection function and IFU allocation strategy, thus correcting the observed sample to a volume-limited sample.

79 ASTRONOMY AND ASTROPHYSICS↗

Identification and Quantification of Beta-Emitters in Waste Packages by Segmented Gamma-Scanning - 20114

A commonly applied method for the non-destructive characterization of the radioactive inventory of waste packages (e.g. 200-l drums) is segmented gamma-scanning. The gamma-emitting inventory is identified via their characteristic lines in the measured spectra. The corresponding net peak areas allow for quantification applying appropriate models. The identification and quantification of beta-emitters present in the waste package require further evaluation. While some of them emit gamma-rays, too, which can be used for identification and quantification, pure beta-emitters contribute to the gamma-spectra only by their Bremsstrahlung-spectra. {sup 32}P, {sup 90}Sr and {sup 90}Y are typical representatives of these isotopes. A method is developed for identification and quantification of these pure beta-emitters in radioactive waste packages. Origin of the procedure is the evaluation of the measured gamma-spectrum. After the identification of all lines present in the spectrum (characteristic gamma-lines, single- and double-escape-lines, X-ray-lines, annihilation peak etc.) this information is used together with calibration data of the detection system and further a-priori information like matrix composition, cross-section data from databases etc. to simulate the spectra without the Bremsstrahlung-components by an appropriate method. This may be Monte Carlo simulations or, like in our case, a computer code taking into account mathematical descriptions of the physical effects like photo effect, (multiple) Compton scattering, backscattering etc. and the attenuation effects of the waste matrix. In any case, the resulting spectrum must simulate the real spectrum without its Bremsstrahlung-component as good as possible. Subtracting the simulated from the measured spectrum then results in the Bremsstrahlung-components caused by the beta-emitters. Prior to evaluation, a set of Bremsstrahlung-spectra is calculated and stored for different beta-emitters in different matrices using the Bethe-Heitler equation. This data set can be extended for new conditions, if necessary, and is allocated in a data base for future application. Applying a non-linear optimization using the generalized reduced gradient method for comparing the calculated with the derived Bremsstrahlung-spectra results in the identification of the beta-emitter and a factor, which is proportional to its activity. The proportionality is determined by previous calibration measurements. The application of the method is demonstrated by measurements on a 200-l mock-up drum and a real waste package. (authors)

07 ISOTOPE AND RADIATION SOURCES↗

Efficient Parallelization of Irregular Applications on GPU Architectures

With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.

Wang, Qihan↗

A Novel Multi-Agent Deep Reinforcement Learning-enabled Distributed Power Allocation Scheme for mmWave Cellular Networks

We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.

99 GENERAL AND MISCELLANEOUS↗

A Fixed-Flexible BESS Allocation Scheme for Transmission Networks Considering Uncertainties

Battery energy storage systems (BESSs) can play a key role in mitigating the intermittency and uncertainty associated with adding large amounts of renewable energy to the bulk power system (BPS). Two BESS technologies that have gained prominence in this regard are Lithium-ion (LI) BESS and Vanadium redox flow (VRF) BESS. Here, this paper proposes a fixed-flexible BESS allocation scheme that exploits the complementary characteristics of LI and VRF BESSs to attain optimal techno-economic benefits in a wind-integrated BPS. Studies carried out on relatively large transmission networks demonstrate that benefits such as reduction in system operation cost, wind spillage, voltage fluctuations, and discounted payback period, can be realized by using the proposed scheme.

42 ENGINEERING↗

MemHC: An Optimized GPU Memory Management Framework for Accelerating Many-body Correlation

The many-body correlation function is a fundamental computation kernel in modern physics computing applications, e.g., Hadron Contractions in Lattice quantum chromodynamics (QCD). This kernel is both computation and memory intensive, involving a series of tensor contractions, and thus usually runs on accelerators like GPUs. Existing optimizations on many-body correlation mainly focus on individual tensor contractions (e.g., cuBLAS libraries and others). In contrast, this work discovers a new optimization dimension for many-body correlation by exploring the optimization opportunities among tensor contractions. More specifically, it targets general GPU architectures (both NVIDIA and AMD) and optimizes many-body correlation’s memory management by exploiting a set of memory allocation and communication redundancy elimination opportunities: first, GPU memory allocation redundancy: the intermediate output frequently occurs as input in the subsequent calculations; second, CPU-GPU communication redundancy: although all tensors are allocated on both CPU and GPU, many of them are used (and reused) on the GPU side only, and thus, many CPU/GPU communications (like that in existing Unified Memory designs) are unnecessary; third, GPU oversubscription: limited GPU memory size causes oversubscription issues, and existing memory management usually results in near-reuse data eviction, thus incurring extra CPU/GPU memory communications.

97 MATHEMATICS AND COMPUTING↗

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗

Equitable Energy Metrics for Integration into Building Performance Standard Tracking Platforms: Preprint

Building Performance Standards (BPS) are being adopted globally and in the United States of America, where 14 different states and jurisdictions have a policy in place and many others are under development (Department of Energy (DOE) 2023). Accurate and equitable data sources are essential to make informed decisions about focusing investment on upgrading buildings to meet jurisdictional goals. There have been multiple new tools developed related to Energy Equity and Environmental Justice (EEEJ) and the resulting datasets need to be integrated into large building port-folios for quick access and better scalability. Integrating EEEJ data in a user-friendly format can help decision makers more quickly assess impacts and analyze the multitude of potentially significant metrics for which there is not yet consensus. In the U.S. and Canada, many BPS ordinances rely primarily on ENERGY STAR Portfolio Manager (ESPM) to capture building characteristics and energy and water consumption data. These datasets can then be imported into city-specific building tracking tools like the Standard Energy Efficiency Data Platform (SEED). Crucially, BPS decision makers require an efficient means of identifying buildings in priority communities to effectively allocate resources and funding. This process must integrate seamlessly with existing jurisdictional toolsets for optimal utility. This paper will demonstrate, for the case of Washington D.C.'s (the District) data, a workflow that provides actionable data for building upgrade investment prioritization in disadvantaged communities.

BPS↗

The price of commitment in online stochastic vehicle routing

This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Early work has focused on very flexible routing settings where the decision to assign a vehicle to a customer is delayed until a vehicle is actually deployed to the customer. Motivated by real applications that require stability in the decision making, this paper considers a setting where the decision to assign a customer request to a vehicle must be taken when that request is accepted. Experimental results suggest that this constraint severely degrades the performance of existing algorithms. However, the paper shows how the use of stochastic information for vehicle assignment and request acceptance improves decision quality considerably. Moreover, the use of resource augmentation quantifies precisely the cost of commitment in online vehicle routing.

97 MATHEMATICS AND COMPUTING↗

Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers

On large supercomputers, the job scheduling systems may assign a non-contiguous node allocation for user applications depending on available resources. With parallel applications using MPI (Message Passing Interface), the default process ordering does not take into account the actual physical node layout available to the application. This contributes to non-locality in terms of physical network topology and impacts communication performance of the application. In order to mitigate such performance penalties, this work describes techniques to identify suitable task mapping that takes the layout of the allocated nodes as well as the application's communication behavior into account. During the first phase of this research, we instrumented and collected performance data to characterize communication behavior of critical US DOE (United States - Department of Energy) applications using an augmented version of the mpiP tool. Subsequently, we developed several reordering methods (spectral bisection, neighbor join tree etc.) to combine node layout and application communication data for optimized task placement. We developed a tool called mpiAproxy to facilitate detailed evaluation of the various reordering algorithms without requiring full application executions. This work presents a comprehensive performance evaluation (14,000 experiments) of the various task mapping techniques in lowering communication costs on Titan, the leadership class supercomputer at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗

Communication Characterization and Optimization of Applications Using Topology-Aware Task Mapping on Large Supercomputers

On large supercomputers, the job scheduling systems may assign a non-contiguous node allocation for user applications depending on available resources. With parallel applications using MPI (Message Passing Interface), the default process ordering does not take into account the actual physical node layout available to the application. This contributes to non-locality in terms of physical network topology and impacts communication performance of the application. In order to mitigate such performance penalties, this work describes techniques to identify suitable task mapping that takes the layout of the allocated nodes as well as the application's communication behavior into account. During the first phase of this research, we instrumented and collected performance data to characterize communication behavior of critical US DOE (United States - Department of Energy) applications using an augmented version of the mpiP tool. Subsequently, we developed several reordering methods (spectral bisection, neighbor join tree etc.) to combine node layout and application communication data for optimized task placement. We developed a tool called mpiAproxy to facilitate detailed evaluation of the various reordering algorithms without requiring full application executions. This work presents a comprehensive performance evaluation (14,000 experiments) of the various task mapping techniques in lowering communication costs on Titan, the leadership class supercomputer at Oak Ridge National Laboratory.

Sreepathi, Sarat↗

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound method are presented: 1. reduction of the size of the solution space by resort to a condensed structure formula, wherein symmetric nuclei are grouped together; 2. partitioning of the solution space based on symmetry, that becomes the basis for an efficient branching procedure; and 3. a criterion of selection of input restrictions that leads to increased gaps between branches and thus faster pruning of non-viable solutions. Although the examples chosen to illustrate this work focus on small-molecule NMR assignment, the results are generic and might help solving other combinatorial optimization problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗