Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 649 records · Page 36

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↗

Virtual Environment for Testing Software-Defined Networking Solutions for Scientific Workflows

Recent developments in software-defined infrastructures promise that scientific workflows utilizing supercomputers, instruments, and storage systems will be dynamically composed and orchestrated using software at unprecedented speed and scale in the near future. Testing of the underlying networking software, particularly during initial exploratory stages, remains a challenge due to potential disruptions, and resource allocation and coordination needed over the multi-domain physical infrastructure. To overcome these challenges, we develop the Virtual Science Network Environment (VSNE) that emulates the multi-site host, storage, and network infrastructure using Virtual Machines (VMs), wherein the production and nascent software can be tested. Within each VM, which represents a site, the hosts and local-area networks are emulated using Mininet, and the Software-Defined Network (SDN) controllers and service daemon codes are natively run to support dynamic provisioning of network connections. Additionally, Lustre filesystem support at the sites and an emulation of the long-haul network using Mininet, are provided using separate VMs. As case studies, we describe Lustre file transfers using XDD, Red5 streaming service demonstration, and an emulated experiment with remote monitoring and steering modules, all supported over dynamically configured connections using SDN controllers.

97 MATHEMATICS AND COMPUTING↗

Better Than Worst-Case Decoding for Quantum Error Correction

The overheads of classical decoding for quantum error correction in cryogenic quantum systems grow rapidly with the number of logical qubits and their correction code distance. Decoding at room temperature is bottlenecked by refrigerator I/O bandwidth while cryogenic on-chip decoding is limited by area/power/thermal budget. To overcome these overheads, we are motivated by the observation that in the common case (over 90% of the time), error correction 'syndromes' are fairly trivial with high redundancy / sparsity, since the error correction codes are over-provisioned to be able to correct for uncommon worst-case complex scenarios (to ensure substantially low logical error rates). If suitably exploited, these trivial scenarios can be handled with insignificant overhead, thereby alleviating any bottlenecks towards handling the worst-case scenarios by state-of-the-art means. Here, we propose Better Than Worst-Case Decoding for Quantum Error Correction, targeting cryogenic quantum systems and Surface Code, consisting of: On-chip Clique Decoder: An extremely lightweight decoder for correcting trivial common-case errors, designed for the cryogenic domain. The decoder is implemented and evaluated for SFQ logic. Statistical Off-chip Bandwidth Allocation: A statistical confidence-based technique for allocation of off-chip decoding bandwidth, to efficiently handle the rare complex decodes that are not covered by the Clique Decoder. Decode-Overflow Execution Stalling: A method to stall circuit execution, for the worst-case scenarios in which the provisioned off-chip bandwidth is insufficient to complete all requested off-chip decodes. In all, BTWC decoding achieves 70-99+% off-chip bandwidth elimination across a range of logical and physical error rates, without significantly sacrificing the accuracy of a state-of-the-art off-chip decoder. Further, it achieves 10-1000x bandwidth reduction over prior bandwidth reduction techniques, as well as 15-37x resource overhead reduction compared to prior on-chip decoding.

cryogenic optimization↗

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗

Umpire: Application-Focused Management and Coordination of Complex Hierarchical Memory

Advanced architectures like Sierra provide a wide range of memory resources that must often be carefully controlled by the user. These resources have varying capacities, access timing rules, and visibility to different compute resources. Applications must intelligently allocate data in these spaces, and depending on the total amount of memory required, applications may also be forced to move data between different parts of the memory hierarchy. Finally, applications using multiple packages must coordinate effectively to ensure that each package can use the memory resources it needs. To address these challenges, we present Umpire, an application-oriented library for managing memory resources. Specifically, Umpire provides support for querying memory resources, provisioning and allocating memory, and memory introspection. It allows computer scientists and computational physicists to efficiently program the memory hierarchies of current and future high-performance computing architectures, without tying their application to specific hardware or software. In this paper, we describe the design and implementation of Umpire and present case studies from the integration of Umpire into applications that are currently running on Sierra.

97 MATHEMATICS AND COMPUTING↗

Economic Impact of Harvesting Corn Stover under Time Constraint: The Case of North Dakota

This study examines the impact of stochastic harvest field time on profit maximizing potential of corn cob/stover collection in North Dakota. Three harvest options are analyzed using mathematical programming models. Our findings show that under the first corn grain only harvest option, farmers are able to complete harvesting corn grain and achieve maximum net income in a fairly short amount of time with existing combine technology. However, under the second simultaneous corn grain and cob (one-pass) harvest option, farmers generate lower net income compared to the net income of the first option. This is due to the slowdown in combine harvest capacity as a consequence of harvesting corn cobs. Under the third option of separate corn grain and stover (two-pass) harvest option, time allocation is the main challenge and our evidence shows that with limited harvest field time available, farmers find it optimal to allocate most of their time harvesting grain and then proceed to harvest and bale stover if time permits at the end of harvest season. The overall findings suggest is that it would be more economically efficient to allow a firm that is specialized in collecting biomass feedstock to participate in cob/stover harvest business.

Maung, Thein A.↗

Berkeley Unified Parallel C (UPC) runtime library

This software comprises a portable, open-source implementation of a runtime library to support applications written in the Unified Parallel C (UPC) language. This library implements the UPC-specific functionality, including shared-memory allocation and distributed locks. The network-dependent functionality is implemented as a thin wrapper around the separate GASNet (Global-Address Space Networking) library, which is required for operation. This software implements the "Berkeley UPC Runtime Specification", which is targeted by at least four separate UPC compiler front-ends. The implementation is highly portable and runs over hardware ranging from laptops to custom supercomputers. An external library is required for certain local memory allocation operations; a well-defined interface allows for multiple implementations of this library, but at present the "umalloc" library from LBNL is the only compatible implementation.

Bonachea, Dan↗

Memory Analysis Tool

This tool traces all memory accesses to stack (static allocation) and heap (dynamic allocation) on a trace run in a particular hardware and then estimates execution time on given arbitrary hardware configurations for hardware design space exploration. It can also compute memory access statistics, such as reuse distance.

Sato, Kento↗

maranasgroup/scRBA

Saccharomyces cerevisiae is an important model organism and a workhorse in bioproduction. Here, we reconstructed a compact and tractable genome-scale resource balance analysis (RBA) model (i.e., named scRBA) to analyze metabolic fluxes and proteome allocation in a computationally efficient manner. Resource capacity models such as scRBA provide the quantitative means to identify bottlenecks in biosynthetic pathways due to enzyme, compartment size, and/or ribosome availability limitations. ATP maintenance rate and in vivo apparent turnover numbers (kapp) were regressed from metabolic flux and protein concentration data to capture observed physiological growth yield and proteome efficiency and allocation, respectively. Estimated parameter values were found to vary with oxygen and nutrient availability. Overall, this work (i) provides condition-specific model parameters to recapitulate phenotypes corresponding to different extracellular environments, (ii) alludes to the enhancing effect of substrate channeling and post-translational activation on in vivo enzyme efficiency in glycolysis and electron transport chain, and (iii) reveals that the Crabtree effect is underpinned by specific limitations in mitochondrial proteome capacity and secondarily ribosome availability rather than overall proteome capacity.

Dinh, Hoang↗

tite

The TITE library provides type erasure implementation utilizing the tag_invoke paradigm proposed for standardization here: https://open-std.org/JTC1/SC22/WG21/docs/papers/2019/p1895r0.pdf. The implementation contained herein is largely modeled after that provided in the standardization proposal and available at https://godbolt.org/z/3TvO4f. Significant modification have been made to the original implementation to improve its suitability to be utilized for GPU architectures. In particular the implementation: - only requires a C++14 standard. - has been extended to obtain vtables for GPU device architectures in addition to CPU host architectures. - provides a gpu_allocator class appropriate for allocation of the type-erased object to GPU memory - provides copy semantics omitted from the original implementation-- - generally the copy semantics are to completely copy the type-erased object - when the usage of the type-erased object guarantees immutability the copy semantics are altered to reference-counted shallow copies (copies of pointers) for improved performance

Solomon, CJ↗

Revenue-Maximizing Shared Parking and Electric Vehicle Charging Management in Multi-Unit Dwellings

In urban areas, searching for parking and electric vehicle (EV) charging can result in cruising, congestion, and environmental externalities. Recognizing the business opportunity of offering private parking and charging infrastructure access within multi-unit dwellings (MUDs) during daytime, we model a shared parking and EV charging management system. We maximize the revenue of MUD charging hubs in mixed land use, catering to public demand. Our approach accounts for the objectives of the two stakeholders involved: a demand model is fitted on the choices of EV charging users, and the supply model optimizes the allocation of parking and charging requests in an MUD parking lot. A binary integer linear programming model for the allocation of parking and charging spaces with a rolling horizon is integrated with matching rules that handle both parking and charging requests. In our numerical experiments in a neighborhood of Chicago, Illinois, we estimate the performance of the MUD parking and charging system with metrics that include revenue, number of matchings, and utilization rates. At any given time, MUDs with lower prices attract more charging requests, particularly those of longer duration, resulting in higher revenue and greater charging utilization. Dynamic pricing facilitates a more equitable distribution of requests; as MUD parking lots reach capacity and their fees increase, other MUDs become more competitive, attracting additional requests. Comparing our method against first-come-first-served and optimal-solution benchmarks, we demonstrate our model’s effectiveness in dynamically managing mixed parking and charging demand in MUD charging hubs.

electric vehicle, multi-unit dwelling, charging in↗

The ECP SICM project: Managing complex memory hierarchies for exascale applications

The Exascale Computing Project (ECP)’s Simplified Interface to Complex Memories (SICM) effort focuses on developing universal interfaces for discovering, managing, and sharing data across complex memory hierarchies. These facilitate the exploitation of emerging memory technologies and support precise control over their various trade-offs such as high-bandwidth versus low-latency, persistent versus ephemeral, high-capacity versus low-capacity, and near-CPU versus near-GPU. SICM comprises three interrelated components: a low-level interface, a high-level interface, and a persistent-heap interface. The low-level SICM interface is intended for system and run-time developers as well as expert application developers who prefer full control of the memory objects used within their application. The high-level SICM interface builds upon the low-level interface, employing application-level profiling and analysis to optimize data management for complex memory hierarchies. The persistent-heap interface provides applications with a persistent memory allocator that can allocate custom C++ data structures in both block-storage and byte-addressable persistent memories.

97 MATHEMATICS AND COMPUTING↗

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↗

Money Matters: A Three-Step Process for Using Budget Data in Program Evaluation to Assess the Design and Management of a Novel Public Health Program

We applied a three-step process, abstracting and analyzing program budgets to examine how Colorectal Cancer Control Program (CRCCP) awardees are structuring their programs and to assess the fidelity of program design to the CRCCP public health model. We reviewed 23 state, one tribal organization, and six university awardee budgets. We assessed resource allocations, staffing structures, and contracted partners and their activities. Awardees allocated 83% of all funds to contracts and personnel. Program managers were the most budgeted personnel type across three measures: number of people, full-time equivalency, and personnel costs. Awardees not only contracted with health care systems and clinics (39% of all contracts) but also contracted other partner types. Contractors were mainly funded to implement evidence-based interventions (25%) and conduct evaluation (24%). Program design varied among awardees in the number of staff (0–22), number of full-time equivalencies (0–5.4), and the number of contracts (1–11) budgeted. State awardees budgeted more resources to contracts, compared with university awardees (57% vs. 31%), while universities budgeted more for total personnel costs (41% vs. 30%). We learned that awardees designed their programs with fidelity to the CRCCP model. Although implementation approaches varied, overall results suggest implementation requires a combination of internal capacities and contracted partners. Budgets provide opportunities to use already existing program data to evaluate program design, partnerships, and planned activities.

Uhd, Justin↗

DynamicME: dynamic simulation and refinement of integrated models of metabolism and protein expression

Background Genome-scale models of metabolism and macromolecular expression (ME models) enable systems-level computation of proteome allocation coupled to metabolic phenotype. Results We develop DynamicME, an algorithm enabling time-course simulation of cell metabolism and protein expression. DynamicME correctly predicted the substrate utilization hierarchy on a mixed carbon substrate medium. We also found good agreement between predicted and measured time-course expression profiles. ME models involve considerably more parameters than metabolic models (M models). We thus generate an ensemble of models (each model having its rate constants perturbed), and then analyze the models by identifying archetypal time-course metabolite concentration profiles. Furthermore, we use a metaheuristic optimization method to calibrate ME model parameters using time-course measurements such as from a (fed-) batch culture. Finally, we show that constraints on protein concentration dynamics (“inertia”) alter the metabolic response to environmental fluctuations, including increased substrate-level phosphorylation and lowered oxidative phosphorylation. Conclusions Overall, DynamicME provides a novel method for understanding proteome allocation and metabolism under complex and transient environments, and to utilize time-course cell culture data for model-based interpretation or model refinement.

Mathematical & Computational Biology↗

Intrahepatic Cholangiocarcinoma: Socioeconomic Discrepancies, Contemporary Treatment Approaches and Survival Trends from the National Cancer Database

Objective: The aim of this study was to evaluate socioeconomic discrepancies in current treatment approaches and survival trends among patients with intrahepatic cholangiocarcinoma (ICC). Methods: The 2004–2015 National Cancer Database was retrospectively analyzed for histopathologically proven ICC. Treatment predictors were evaluated using multinomial logistic regression and overall survival via multivariable Cox models. Results: Overall, 12,837 ICC patients were included. Multiple factors influenced treatment allocation, including age, education, comorbidities, cancer stage, grade, treatment center, and US state region (multivariable p < 0.05). The highest surgery rates were observed in the Middle Atlantic (28.7%) and lowest rates were observed in the Mountain States (18.4%). Decreased ICC treatment likelihood was observed for male African Americans with Medicaid insurance and those with low income (multivariable p < 0.05). Socioeconomic treatment discrepancies translated into decreased overall survival for patients of male sex (vs. female; hazard ratio [HR] 1.21, 95% confidence interval [CI] 1.16–1.26, p < 0.001), with low income (< $37,999 vs. ≥ $63,000 annually; HR 1.07, 95% CI 1.01–1.14, p = 0.032), and with Medicaid insurance (vs. private insurance; HR 1.13, 95% CI 1.04–1.23, p = 0.006). Both surgical and non-surgical ICC management showed increased survival compared with no treatment, with the longest survival for surgery (5-year overall survival for surgery, 33.5%; interventional oncology, 11.8%; radiation oncology/chemotherapy, 4.4%; no treatment, 3.3%). Among non-surgically treated patients, interventional oncology yielded the longest survival versus radiation oncology/chemotherapy (HR 0.73, 95% CI 0.65–0.82, p < 0.001). Conclusions: ICC treatment allocation and outcome demonstrated a marked variation depending on socioeconomic status, demography, cancer factors, and US geography. Healthcare providers should address these discrepancies by providing surgery and interventional oncology as first-line treatment to all eligible patients, with special attention to the vulnerable populations identified in this study.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Data for Physiological Controls on Carbon Fluxes and Biomass Production in Miscanthus: Insights From a Process- Based Agroecosystem Model

Biomass crops serve as essential feedstocks for renewable energy and bioproducts and play a critical role in achieving lower emissions in the transportation sector. However, dedicated perennial biomass crops such as Miscanthus × giganteus (Miscanthus) remain underrepresented in process- based agroecosystem models, limiting robust evaluation of their economic and environmental performance. In this study, we developed a data- constrained representation of the sterile triploid Miscanthus (IL clone) within the process- based model ecosys, integrating global sensitivity analysis, ensemble simulation, and parameter calibration. Planting, harvesting, and fertilization practices consistent with field management were incorporated, and phenology was constrained using PhenoCam- derived Green Chromatic Coordinate (GCC) data. Using the Morris global sensitivity analysis method, we identified 11 key physiological parameters governing plant carbon, water, and nutrient relations, particularly processes associated with CO2 assimilation. We then conducted ensemble simulations by perturbing these parameters and calibrated the model against eddy covariance fluxes and field- measured biomass. Building on the calibrated operating state, parameter- response analyses show that different photosynthetic processes influence productivity in different ways. Protein allocation determines whether productivity increases toward a higher level, whereas electron transport capacity controls additional gains once protein allocation approaches saturation. These findings demonstrate that parameter importance depends on physiological context and on which photosynthetic processes remain limiting. Calibration and validation against observations show that ecosys can reliably reproduce carbon and water fluxes, as well as both above- and belowground biomass, with post- calibration GPP R2 improving from 0.67 to 0.95 during the calibration period and remaining high during validation (R2 = 0.95). These results provide a mechanistic foundation for regional simulations and sustainable bioenergy assessments.

Carbon↗

Data for Climate vs Energy Security: Quantifying the Trade-offs of BECCS Deployment and Overcoming Opportunity Costs on Set-Aside Land

Bioenergy with carbon capture and storage (BECCS) sits at the nexus of the climate and energy security. We evaluated trade-offs between scenarios that support climate stabilization (negative emissions and net climate benefit) or energy security (ethanol production). Our spatially explicit model indicates that the foregone climate benefit from abandoned cropland (opportunity cost) increased carbon emissions per unit of energy produced by 14–36%, making geologic carbon capture and storage necessary to achieve negative emissions from any given energy crop. The toll of opportunity costs on the climate benefit of BECCS from set-aside land was offset through the spatial allocation of crops based on their individual biophysical constraints. Dedicated energy crops consistently outperformed mixed grasslands. We estimate that BECCS allocation to land enrolled in the Conservation Reserve Program (CRP) could capture up to 9 Tg C year–1 from the atmosphere, deliver up to 16 Tg CE year–1 in emissions savings, and meet up to 10% of the US energy statutory targets, but contributions varied substantially as the priority shifted from climate stabilization to energy provision. Our results indicate a significant potential to integrate energy security targets into sustainable pathways to climate stabilization but underpin the trade-offs of divergent policy-driven agendas.

Field Data↗