Search NASA⌕ Search

SEARCH · Search NASA

Results for “Resource 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 73 records · Page 4

Resource allocation planning helper (RALPH)

The following topics are presented in view graph form: the background of the Resource Allocation Planning Helper (RALPH); RALPH schedule lifecycle; scheduling approach; technology layering; details; and RALPH directions.

Werntz, David G.↗

A Methodology for Dynamic Security Risk Quantification and Optimal Resource Allocation of Security Assets

In this presentation we overview a methodology for dynamic security risk quantification and optimal resource allocation of security assets for high profile venues. This methodology is especially applicable to venues that require security screening operations such as mass transit (e.g., train or airport terminals), critical infrastructure protection (e.g., government buildings), and largescale public events (e.g., concerts or professional sports). The method starts by decomposing the three core components of risk -- threat, vulnerability, and consequence -- into their various subcomponents. For instance, vulnerability can be decomposed into availability, accessibility, organic security, and target hardness and each of these can be evaluated against the potential threats of interest for the given venue. Once evaluated, these subcomponents are rolled back up to compute the specific value for the vulnerability core risk component. Likewise, the same is done for consequence and threat, and then risk is computed as the product of these three components. A key aspect of our methodology is dynamically quantifying risk. That is, we incorporate the ability to uniquely allow the subcomponents and core components, and in turn, risk, to be quantified as a continuous function of time throughout the day, week, month, or year as appropriate.

Brigantic, Robert T.↗

Iterative-deepening heuristic search for optimal and semi-optimal resource allocation

It is demonstrated that when iterative-deepening A asterisk (IDA asterisk) is applied to one type of resource allocation problem, it uses far less storage than A asterisk, but opens far more nodes and thus has unacceptable time complexity. This is shown to be due, at least in part, to the low-valued effective branching factor that is a characteristic of problems with real-valued cost functions. The semi-optimal, epsilon-admissible IDA asterisk sub epsilon search algorithm that the authors described was shown to open fewer nodes than both A asterisk and IDA asterisk with storage complexity proportional to the depth of the search tree.

Bridges, Susan M.↗

Develop feedback system for intelligent dynamic resource allocation to improve application performance.

This report provides documentation for the completion of the Sandia Level II milestone 'Develop feedback system for intelligent dynamic resource allocation to improve application performance'. This milestone demonstrates the use of a scalable data collection analysis and feedback system that enables insight into how an application is utilizing the hardware resources of a high performance computing (HPC) platform in a lightweight fashion. Further we demonstrate utilizing the same mechanisms used for transporting data for remote analysis and visualization to provide low latency run-time feedback to applications. The ultimate goal of this body of work is performance optimization in the face of the ever increasing size and complexity of HPC systems.

99 GENERAL AND MISCELLANEOUS↗

RAPID, MACHINE-LEARNED RESOURCE ALLOCATION: APPLICATION TO HIGH-REDSHIFT GAMMA-RAY BURST FOLLOW-UP

As the number of observed gamma-ray bursts (GRBs) continues to grow, follow-up resources need to be used more efficiently in order to maximize science output from limited telescope time. As such, it is becoming increasingly important to rapidly identify bursts of interest as soon as possible after the event, before the afterglows fade beyond detectability. Studying the most distant (highest redshift) events, for instance, remains a primary goal for many in the field. Here, we present our Random Forest Automated Triage Estimator for GRB redshifts (RATE GRB-z ) for rapid identification of high-redshift candidates using early-time metrics from the three telescopes onboard Swift. While the basic RATE methodology is generalizable to a number of resource allocation problems, here we demonstrate its utility for telescope-constrained follow-up efforts with the primary goal to identify and study high-z GRBs. For each new GRB, RATE GRB-z provides a recommendation-based on the available telescope time-of whether the event warrants additional follow-up resources. We train RATE GRB-z using a set consisting of 135 Swift bursts with known redshifts, only 18 of which are z > 4. Cross-validated performance metrics on these training data suggest that {approx}56% of high-z bursts can be captured from following up the top 20% of the ranked candidates, and {approx}84% of high-z bursts are identified after following up the top {approx}40% of candidates. We further use the method to rank 200 + Swift bursts with unknown redshifts according to their likelihood of being high-z.

79 ASTRONOMY AND ASTROPHYSICS↗

Resource allocation using constraint propagation

The concept of constraint propagation was discussed. Performance increases are possible with careful application of these constraint mechanisms. The degree of performance increase is related to the interdependence of the different activities resource usage. Although this method of applying constraints to activities and resources is often beneficial, it is obvious that this is no panacea cure for the computational woes that are experienced by dynamic resource allocation and scheduling problems. A combined effort for execution optimization in all areas of the system during development and the selection of the appropriate development environment is still the best method of producing an efficient system.

Rogers, John S.↗

Resource allocation using quantification of margins and uncertainty.

There is an increasing need to assess the performance of high consequence systems using a modeling and simulation based approach. Central to this approach are the need to quantify the uncertainties present in the system and to compare the system response to an expected performance measure. At Sandia National Laboratories, this process is referred to as quantification of margins and uncertainties or QMU. Depending on the outcome of the assessment, there might be a need to increase the confidence in the predicted response of a system model; thus a need to understand where resources need to be allocated to increase this confidence. This paper examines the problem of resource allocation done within the context of QMU. An optimization based approach to solving the resource allocation is considered and sources of aleatoric and epistemic uncertainty are included in the calculations.

97 MATHEMATICS AND COMPUTING↗

Dynamic resource allocation drives growth under nitrogen starvation in eukaryotes

Cells can sense changes in their extracellular environment and subsequently adapt their biomass composition. Nutrient abundance defines the capability of the cell to produce biomass components. Under nutrient-limited conditions, resource allocation dramatically shifts to carbon-rich molecules. Here, we used dynamic biomass composition data to predict changes in growth and reaction flux distributions using the available genome-scale metabolic models of five eukaryotic organisms (three heterotrophs and two phototrophs). We identified temporal profiles of metabolic fluxes that indicate long-term trends in pathway and organelle function in response to nitrogen depletion. Surprisingly, our calculations of model sensitivity and biosynthetic cost showed that free energy of biomass metabolites is the main driver of biosynthetic cost and not molecular weight, thus explaining the high costs of arginine and histidine. We demonstrated how metabolic models can accurately predict the complexity of interwoven mechanisms in response to stress over the course of growth.

59 BASIC BIOLOGICAL SCIENCES↗

The Effects of Task Structure on Time-sharing Efficiency and Resource Allocation Optimality

A distinction was made between two aspects of time sharing performance: time sharing efficiency and attention allocation optimality. A secondary task technique was employed to evaluate the effects of the task structures of the component time shared tasks on both aspects of the time sharing performance. Five pairs of dual tasks differing in their structural configurations were investigated. The primary task was a visual/manual tracking task which requires spatial processing. The secondary task was either another tracking task or a verbal memory task with one of four different input/output configurations. Congruent to a common finding, time-sharing efficiency was observed to decrease with an increasing overlap of resources utilized by the time shared tasks. Research also tends to support the hypothesis that resource allocation is more optimal when the time shared tasks placed heavy demands on common processing resources than when they utilized separate resources.

Tsang, P. S.↗

Optimal resource allocation for flexible-grid entanglement distribution networks

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

97 MATHEMATICS AND COMPUTING↗

Current State, Challenges, and Opportunities in Genome-Scale Resource Allocation Models: A Mathematical Perspective

Stoichiometric genome-scale metabolic models (generally abbreviated GSM, GSMM, or GEM) have had many applications in exploring phenotypes and guiding metabolic engineering interventions. Nevertheless, these models and predictions thereof can become limited as they do not directly account for protein cost, enzyme kinetics, and cell surface or volume proteome limitations. Lack of such mechanistic detail could lead to overly optimistic predictions and engineered strains. Initial efforts to correct these deficiencies were by the application of precursor tools for GSMs, such as flux balance analysis with molecular crowding. In the past decade, several frameworks have been introduced to incorporate proteome-related limitations using a genome-scale stoichiometric model as the reconstruction basis, which herein are called resource allocation models (RAMs). This review provides a broad overview of representative or commonly used existing RAM frameworks. This review discusses increasingly complex models, beginning with stoichiometric models to precursor to RAM frameworks to existing RAM frameworks. RAM frameworks are broadly divided into two categories: coarse-grained and fine-grained, with different strengths and challenges. Discussion includes pinpointing their utility, data needs, highlighting framework strengths and limitations, and appropriateness to various research endeavors, largely through contrasting their mathematical frameworks. Finally, promising future applications of RAMs are discussed.

59 BASIC BIOLOGICAL SCIENCES↗

Relatively rare root endophytic bacteria drive plant resource allocation patterns and tissue nutrient concentration in unpredictable ways

Plant endophytic bacterial strains can influence plant traits such as leaf area and root length. Yet, the influence of more complex bacterial communities in regulating overall plant phenotype is less explored. Here, in two complementary experiments, we tested whether we can predict plant phenotype response to changes in microbial community composition. In the first study, we inoculated a single genotype of Populus deltoides with individual root endophytic bacteria and measured plant phenotype. Next, data from this single inoculation were used to predict phenotypic traits after mixed three-strain community inoculations, which we tested in the second experiment. By itself, each bacterial endophyte significantly but weakly altered plant phenotype relative to noninoculated plants. In a mixture, bacterial strain Burkholderia BT03, constituted at least 98% of community relative abundance. Yet, plant resource allocation and tissue nutrient concentrations were disproportionately influenced by Pseudomonas sp. GM17, GM30, and GM41. We found a 10% increase in leaf mass fraction and an 11% decrease in root mass fraction when replacing Pseudomonas GM17 with GM41 in communities containing both Pseudomonas GM30 and Burkholderia BT03. Our results indicate that interactions among endophytic bacteria may drive plant phenotype over the contribution of each strain individually. Additionally, we have shown that low-abundance strains contribute to plant phenotype challenging the assumption that the dominant strains will drive plant function.

59 BASIC BIOLOGICAL SCIENCES↗

Recovery Simulator and Analysis Formulation: Mathematical Framework for Enhanced Resilience and Resource Allocation

This report introduces recovery simulator and analysis (RSA), a framework aimed at enhancing the resilience of electrical grids post-disruption. The RSA model leverages an optimization problem formulation that focuses on maximizing the load served (or optionally customers served) through a coordinated and cooptimized recovery of non-black start generation, transmission lines, feeders and substations subject to labor budget constraints. By integrating advanced linear programming techniques, the simulator selects efficient reocovery pathways, optimizing both short-term and long-term grid recovery strategies. The mathematical framework guides decision-making through a comprehensive evaluation of potential recovery actions, factoring in the trade-offs between labor constraints and load (or optionally customer) restoration efficacy. This enables grid operators to simulate diverse outage scenarios and delineate optimal recovery pathways, thereby prioritizing critical repair tasks and ensuring resource allocation is both economical and effective. The intended use case of RSA is to allow planners to explore many recovery scenarios quickly and determine assets most critical across a wide range of scenarios, and therefore strong candidates for hardening or additional investment. RSA might also be used in an operational setting, following a single event, for exploring efficient recovery pathways.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Time Utility Functions for Modeling and Evaluating Resource Allocations in a Heterogeneous Computing System

This study considers a heterogeneous computing system and corresponding workload being investigated by the Extreme Scale Systems Center (ESSC) at Oak Ridge National Laboratory (ORNL). The ESSC is part of a collaborative effort between the Department of Energy (DOE) and the Department of Defense (DoD) to deliver research, tools, software, and technologies that can be integrated, deployed, and used in both DOE and DoD environments. The heterogeneous system and workload described here are representative of a prototypical computing environment being studied as part of this collaboration. Each task can exhibit a time-varying importance or utility to the overall enterprise. In this system, an arriving task has an associated priority and precedence. The priority is used to describe the importance of a task, and precedence is used to describe how soon the task must be executed. These two metrics are combined to create a utility function curve that indicates how valuable it is for the system to complete a task at any given moment. This research focuses on using time-utility functions to generate a metric that can be used to compare the performance of different resource schedulers in a heterogeneous computing system. The contributions of this paper are: (a) a mathematical model of a heterogeneous computing system where tasks arrive dynamically and need to be assigned based on their priority, precedence, utility characteristic class, and task execution type, (b) the use of priority and precedence to generate time-utility functions that describe the value a task has at any given time, (c) the derivation of a metric based on the total utility gained from completing tasks to measure the performance of the computing environment, and (d) a comparison of the performance of resource allocation heuristics in this environment.

99 GENERAL AND MISCELLANEOUS↗

The Myth of Fungible FTE: A Quantitative Assessment of Matrixed Resource Allocation

Matrix organizations allow scientific facilities to share specialized personnel across projects, operations, maintenance, and strategic initiatives. Nominal staffing allocations, however, may not capture the schedule consequences of fragmented individual commitments, limited access to specialist groups, and intermittent availability of key decision makers. We developed a stochas- tic, daily-time-step simulation of a hypothetical medium-sized accelerator-facility project com- prising sequential phases and parallel tasks. Each task requires role-specific work measured in FTE-days. Ordinary personnel may be unavailable because they contribute concurrently to other institutional activities, while designated key roles have independently specified daily un- availability probabilities. An organization-wide priority factor scales the number of people from each functional group who can effectively contribute to the project. It is interpreted as a composite proxy for project access and workforce fragmentation across competing commit- ments. We examined project completion time as a function of this factor and Project Lead unavailability using 100 Monte Carlo runs per condition. Increasing priority factor from 0.1 to 1.0 reduced median completion time from 1708.5 days (interquartile range 1681.5–1735.25) to 390 days (interquartile range 379–399). At priority factor = 0.1, increasing Project Lead unavailability from 0.5 to 0.9 increased median completion time from 1713.5 days (interquartile range 1691–1733.25) to 4,417 days (interquartile range 4271.75–4550.5). The model quantifies the commonly expected sensitivity of project schedules to fragmented resource commitments and limited coordination availability. Within this model, the results also indicate a possible threshold regime in which small increases in workforce availability yield only modest sched- ule improvements until sufficient capacity becomes accessible, after which project performance improves sharply. With further validation and calibration, this quantitative framework could support resource-allocation decisions during initial project planning and subsequent schedule rebaselining.

Bai, Mei [SLAC National Accelerator Laboratory (SL↗

Software for Allocating Resources in the Deep Space Network

TIGRAS 2.0 is a computer program designed to satisfy a need for improved means for analyzing the tracking demands of interplanetary space-flight missions upon the set of ground antenna resources of the Deep Space Network (DSN) and for allocating those resources. Written in Microsoft Visual C++, TIGRAS 2.0 provides a single rich graphical analysis environment for use by diverse DSN personnel, by connecting to various data sources (relational databases or files) based on the stages of the analyses being performed. Notable among the algorithms implemented by TIGRAS 2.0 are a DSN antenna-load-forecasting algorithm and a conflict-aware DSN schedule-generating algorithm. Computers running TIGRAS 2.0 can also be connected using SOAP/XML to a Web services server that provides analysis services via the World Wide Web. TIGRAS 2.0 supports multiple windows and multiple panes in each window for users to view and use information, all in the same environment, to eliminate repeated switching among various application programs and Web pages. TIGRAS 2.0 enables the use of multiple windows for various requirements, trajectory-based time intervals during which spacecraft are viewable, ground resources, forecasts, and schedules. Each window includes a time navigation pane, a selection pane, a graphical display pane, a list pane, and a statistics pane.

Wang, Yeou-Fang↗