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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2017

Proportion of fine roots, but not plant biomass allocation below ground, increases with elevation in arctic tundra

Questions: Roots represent a considerable proportion of biomass, primary production and litter input in arctic tundra, and plant allocation of biomass to above- or below- ground tissue in response to climate change is a key factor in the future C balance of these ecosystems. According to optimality theory plants allocate C to the above- or below-ground structure that captures the most limiting resource. We used an elevational gradient to test this theory and as a space-for-time substitution to inform on tundra carbon allocation patterns under a shifting climate, by exploring if increasing elevation was positively related to the root:shoot ratio, as well as a larger plant allocation to adsorptive over storage roots. Location: Arctic tundra heath dominated by Empetrum hermaphroditum close to Abisko, Sweden. Methods: We measured root:shoot and fine:coarse root ratios of the plant communities along an elevational gradient by sampling above- and below-ground biomass, further separating root biomass into fine (<1 mm) and coarse roots. Results: Plant biomass was higher at the lower elevations, but the root:shoot ratio did not vary with elevation. Resource allocation to fine relative to coarse roots increased with elevation, resulting in a fine:coarse root ratio that more than doubled with in- creasing elevation. Conclusions: Contrary to previous works, the root:shoot ratio along this elevational gradient remained stable. However, communities along our study system were dominated by the same species at each elevation, which suggests that when changes in the root:shoot ratio occur with elevation these changes may be driven by differences in allocation patterns among species and thus turnover in plant community structure. Our results further reveal that the allocation of biomass to fine relative to coarse roots can differ between locations along an elevational gradient, even when overall above- vs below-ground biomass allocation does not. Given the functionally different roles of fine vs coarse roots this could have large implications for below-ground C cycling. Thus. our results highlight the importance of direct effects vs indirect effects (such as changes in plant community composition and nutrient availability) of climate change for future C allocation above and below ground.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1988

An intelligent allocation algorithm for parallel processing

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

Carroll, Chester C.↗

NASA NTRS1987

Task allocation among multiple intelligent robots

Researchers describe the design of a decentralized mechanism for allocating assembly tasks in a multiple robot assembly workstation. Currently, the approach focuses on distributed allocation to explore its feasibility and its potential for adaptability to changing circumstances, rather than for optimizing throughput. Individual greedy robots make their own local allocation decisions using both dynamic allocation policies which propagate through a network of allocation goals, and local static and dynamic constraints describing which robots are elibible for which assembly tasks. Global coherence is achieved by proper weighting of allocation pressures propagating through the assembly plan. Deadlock avoidance and synchronization is achieved using periodic reassessments of local allocation decisions, ageing of allocation goals, and short-term allocation locks on goals.

Gasser, L.↗

DOE OSTI2016

Makalu: fast recoverable allocation of non-volatile memory

Byte addressable non-volatile memory (NVRAM) is likely to supplement, and perhaps eventually replace, DRAM. Applications can then persist data structures directly in memory instead of serializing them and storing them onto a durable block device. However, failures during execution can leave data structures in NVRAM unreachable or corrupt. In this paper, we present Makalu, a system that addresses non-volatile memory management. Makalu offers an integrated allocator and recovery-time garbage collector that maintains internal consistency, avoids NVRAM memory leaks, and is efficient, all in the face of failures. We show that a careful allocator design can support a less restrictive and a much more familiar programming model than existing persistent memory allocators. Our allocator significantly reduces the per allocation persistence overhead by lazily persisting non-essential metadata and by employing a post-failure recovery-time garbage collector. Experimental results show that the resulting online speed and scalability of our allocator are comparable to well-known transient allocators, and significantly better than state-of-the-art persistent allocators.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Soil nutrients affect biomass allocation at the individual tree level in Populus_deltoides

The allocation of carbon (C) to tree roots has implication for forest productivity and soil C storage. Here, we elucidated the factors affecting absolute and relative production of resource-acquiring absorptive fine roots (AFR) and other tree organs. We assessed soil properties, leaf (Leaves), stem and branch (Stem-Br), coarse root (CR), transport fine root (TFR), and AFR biomass, production, and allocation and leaf litterfall and AFR and TFR turnover for 12 trees in a youngPopulus deltoides plantation. On a biomass basis, standing crop of AFRs was significantly related to that of TFRs, but both were independent of biomass of leaves, CRs and Stem-Brs. Production (standing crop + turnover) as a proportion of total biomass (allocation) highlighted significant relationships between AFR%, TFR%, and tree and soil characteristics. AFR% and TFR% were negatively correlated with Stem-Br%, Leaf%, and total tree production. Spatial variation in soil nutrient gradients altered allocation withinP. deltoides.AFR% and TFR% were negatively correlated with CEC, N, and Ca but positively correlated with soil P, Fe, and Na. Stem-Br% was positively correlated with CEC and soil N but negatively correlated with P. AFR and TFR growth and death are tightly coupled at the individual tree level. AFR allocation, but not standing biomass, is highly correlated with allocation to leaves, suggesting tight regulation of the growth of these two resource-acquiring organs. Lower soil N and Ca increased allocation to AFRs at the cost of leaves, whereas allocation to AFRs and leaves increased with soil P. Such changes in response to soil P may control whole-tree production in the current study.

Biomass allocation↗

DOE OSTI2020

Effects of nitrogen enrichment on tree carbon allocation: A global synthesis

Aim: Increased atmospheric nitrogen deposition may have profound effects on tree carbon allocation dynamics. However, a comprehensive understanding of how nitro-gen (N) enrichment influences carbon (C) allocation across plant functional processes and tree organs in individual trees remains elusive. Location: Global forest ecosystems. Time period: 1990–2018. Major taxa studied: Trees. Methods: We compiled data from 75 N addition experiments and conducted a meta-analysis to evaluate the responses of C source (photosynthesis), sinks (growth and respiration) and storage (non-structural carbohydrate concentrations) in different tree organs (foliage, above-ground wood and roots) to N enrichment. Results: N enrichment significantly enhanced C supply via photosynthesis (+39.6%, n = 128). C allocation to growth (biomass increment/production) significantly in-creased in foliage (+15.9%, n = 68) and above-ground wood (+31.8%, n = 64; bole, branch, stem and/or twig) with increasing N availability, but not in roots, whereas allocation increased in roots via increasing fine root turnover rate (+22.6%, n = 11). N fertilization significantly increased C allocation to respiration in above-ground wood (+46.6%, n = 12) and roots (+5.5%, n = 57), but not in foliage. N addition decreased non-structural carbohydrate (NSC) concentrations in foliage (-5.4%, n = 16) and roots (-5.0%, n = 21), but increased NSC in above-ground wood (+6.1%, n = 22). In addition, N enrichment effects were strongly affected by moderator variables. Main conclusions: Our results demonstrate that N addition increased C allocation to growth and respiration more strongly than C allocation to NSC storage, and increased C allocation to above-ground parts more strongly than to below-ground parts. Our results are useful for better understanding the response of tree functional processes at organ level to N enrichment. The existing data also reveal that more long-term ex-perimental studies on mature trees in tropical and boreal forests are urgently needed to provide a basis for forecasting tree responses to N enrichment at the global scale.

Li, Weibin↗

NASA NTRS1981

Spectrum allocations above 40 GHz

The 1979 World Administrative Radio Conference (WARC-79) revised the International Table of Frequency Allocations to reflect increased interest and activity in the region of the EM spectrum above 40 GHz. The total width of the spectrum allocated (235 GHz) in the region above 40 GHz indicates the extent of this new spectrum resource, made accessible by advances in the state-of-the-art of telecommunications equipment. There are some striking differences between the approach to allocation above and below 40 GHz. For example, there are not bands allocated exclusively. This reflects the characteristics of propagation and the small antenna beamwidths achievable at these frequencies. Attention is given to atmospheric window and absorption band limits, allocations to satellite services, allocations to scientific services, allocations to terrestrial services, the future refinement of the radio regulations above 40 GHz, and allocations of WARC-79 and frequency management.

Katzenstein, W. E.↗

NASA NTRS2012

Methodology to Support Dynamic Function Allocation Policies Between Humans and Flight Deck Automation

Function allocation assigns work functions to all agents in a team, both human and automation. Efforts to guide function allocation systematically have been studied in many fields such as engineering, human factors, team and organization design, management science, cognitive systems engineering. Each field focuses on certain aspects of function allocation, but not all; thus, an independent discussion of each does not address all necessary aspects of function allocation. Four distinctive perspectives have emerged from this comprehensive review of literature on those fields: the technology-centered, human-centered, team-oriented, and work-oriented perspectives. Each perspective focuses on different aspects of function allocation: capabilities and characteristics of agents (automation or human), structure and strategy of a team, and work structure and environment. This report offers eight issues with function allocation that can be used to assess the extent to which each of issues exist on a given function allocation. A modeling framework using formal models and simulation was developed to model work as described by the environment, agents, their inherent dynamics, and relationships among them. Finally, to validate the framework and metrics, a case study modeled four different function allocations between a pilot and flight deck automation during the arrival and approach phases of flight.

Johnson, Eric N.↗

DOE OSTI2013

A survey on resource allocation in high performance distributed computing systems

An efficient resource allocation is a fundamental requirement in high performance computing (HPC) systems. Many projects are dedicated to large-scale distributed computing systems that have designed and developed resource allocation mechanisms with a variety of architectures and services. In our study, through analysis, a comprehensive survey for describing resource allocation in various HPCs is reported. The aim of the work is to aggregate under a joint framework, the existing solutions for HPC to provide a thorough analysis and characteristics of the resource management and allocation strategies. Resource allocation mechanisms and strategies play a vital role towards the performance improvement of all the HPCs classifications. Therefore, a comprehensive discussion of widely used resource allocation strategies deployed in HPC environment is required, which is one of the motivations of this survey. Moreover, we have classified the HPC systems into three broad categories, namely: (a) cluster, (b) grid, and (c) cloud systems and define the characteristics of each class by extracting sets of common attributes. All of the aforementioned systems are cataloged into pure software and hybrid/hardware solutions. The system classification is used to identify approaches followed by the implementation of existing resource allocation strategies that are widely presented in the literature.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Developing capacitated p-median location-allocation model in the spopt library to allow UCL student teacher placements using public transport

Location-allocation is a key tool within the GIS and network analysis toolbox. In this paper we discuss the real world application of a location-allocation case study (approx 800 students, 500 schools) from UCL using public transport. The use of public transportation is key for this case study, as many location-allocation approaches only make use of drive-time or walking-time distances, but the location of UCL in Greater London, UK makes the inclusion of public transport vital for this case study. The location-allocation is implemented as a capacitated p-median location-allocation model, using the spopt library, part of the Python Spatial Analysis Library (PySAL). The capacitated variation of the p-median location-allocation problem is a new addition to the spopt library, which this work will present. The results from the initial version of the capacitated p-median location-allocation problem has shown a marked improvement on public transport travel time, with public transport travel time reduced by 891 minutes overall for an initial sample of 93 students (9.58 minutes per student). Results will be presented below and plans for further improvement shared.

Bearman, Nick↗

NASA NTRS2000

Patch Network for Power Allocation and Distribution in Smart Materials

The power allocation and distribution (PAD) circuitry is capable of allocating and distributing a single or multiple sources of power over multi-elements of a power user grid system. The purpose of this invention is to allocate and distribute power that is collected by individual patch rectennas to a region of specific power-user devices, such as actuators. The patch rectenna converts microwave power into DC power. Then this DC power is used to drive actuator devices. However, the power from patch rectennas is not sufficient to drive actuators unless all the collected power is effectively used to drive another group by allocation and distribution. The power allocation and distribution (PAD) circuitry solves the shortfall of power for devices in a large array. The PAD concept is based on the networked power control in which power collected over the whole array of rectennas is allocated to a sub domain where a group of devices is required to be activated for operation. Then the allocated power is distributed to individual element of power-devices in the sub domain according to a selected run-mode.

Golembiewski, Walter T.↗

NASA NTRS2000

Proposal Drafted for Allocating Space-to-Space Frequencies in the GPS Spectrum Bands

Radionavigation Satellite Service (RNSS) systems such as the U.S. Global Positioning System (GPS) and the Russian Global Navigation Satellite System (GLONASS) are primarily being used today in the space-to-Earth direction (i.e., from GPS satellite to Earth user) for a broad range of applications such as geological surveying; aircraft, automobile, and maritime navigation; hiking and mountain climbing; and precision farming and mining. However, these navigation systems are being used increasingly in space. Beginning with the launch of the TOPEX/Poseidon remote-sensing mission in 1992, over 90 GPS receivers have flown onboard spacecraft for such applications as real-time spacecraft navigation, three-axis attitude control, precise time synchronization, precision orbit determination, and atmospheric profiling. In addition to use onboard many science spacecraft, GPS has been used or is planned to be used onboard the shuttles, the International Space Station, the International Space Station Emergency Crew Return Vehicle, and many commercial satellite systems such as Orbcomm, Globalstar, and Teledesic. From a frequency spectrum standpoint, however, one important difference between the space and terrestrial uses of GPS is that it is being used in space with no interference protection. This is because there is no frequency allocation for the space-to-space use of GPS (i.e., from GPS satellite to user spacecraft) in the International Telecommunications Union (ITU) regulatory table of frequency allocations. If another space-based or groundbased radio system interferes with a spaceborne GPS user, the spaceborne user presently has no recourse other than to accept the interference. Consequently, for the past year and a half, the NASA Glenn Research Center at Lewis Field and other Government agencies have been working within ITU toward obtaining a GPS space-to-space allocation at the next World Radio Conference in the year 2000 (WRC 2000). Numerous interference studies have been conducted in support of a primary space-tospace allocation in the 1215- to 1260-MHz and 1559- to 1610-MHz RNSS bands. Most of these studies and analyses were performed by Glenn and submitted as U.S. input documents to the international Working Party 8D meetings in Geneva, Switzerland. In the structure of the ITU, Working Party 8D is responsible for frequency spectrum issues in the RNSS and the mobile satellite service (MSS). The full texts of the studies are available from the ITU web site under Working Party 8D contributions. Note that because spaceborne RNSS receivers operate in a receive-only mode with navigation signals already being broadcast toward the Earth, the addition of a space-tospace allocation will not result in interference with other systems. A space-based RNSS receiver, however, could experience interference from systems of other services, including intraservice interference from other RNSS systems. The interference scenarios examined in the studies can be inferred from the following frequency allocation charts. In these charts, services labeled in all capital letters (e.g., "ARNS") have primary status, whereas those labeled with sentence-style capitalization (e.g., "Amateur radio") have secondary status (i.e., a service with secondary status cannot claim interference protection from or cause harmful interference to a service with primary status). Charts showing the ITU frequency allocations in the 960 to 1350 MHZ range and the 1525-1660 MHZ range are discussed and presented.

Spence, Rodney L.↗

NASA NTRS1998

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and weighted links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Weights are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗

NASA NTRS1996

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and directed links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Reliability values are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗

NASA NTRS2018

Affine Generalized Inverse for Optimal Control Allocation

This research is a follow on to the "Optimal Control Prediction Method for Control Allocation" paper in which the Prediction Method iterative algorithm was introduced. Previously, the Prediction Method was shown to provide optimal control allocation solutions over the entire Attainable Moment Set for the Moore-Penrose and the generalized (weighted) inverse. As an extension to the Prediction Method, this paper introduces a family of Moore Penrose Affine Generalized Inverses, applicable for all moments, which compute control allocation solutions using a constant matrix and fixed null-space vector. The Moore-Penrose Affine Generalized Inverse is proven to yield equivalent solutions to those of the Prediction Method and therefore is guaranteed to yield Moore-Penrose optimal control allocation solutions. While the Prediction Method is applicable for any moment along an a priori specified moment direction, the Affine Generalized Inverse is shown to yield optimal control allocation solutions in a neighborhood of the given moment which is not restricted to a specified moment direction. Furthermore, the Affine Generalized Inverse is shown to provide the time derivative of optimal control allocation solutions and to facilitate maintaining solutions within control effector rate limitations. The Moore-Penrose Affine Generalized Inverse is broadened to encompass any arbitrary (weighted) Affine Generalized Inverse. Finally, a method of creating a moment lookup table is outlined to utilize the Affine Generalized Inverse as an offline control allocation solution for all moments in the Attainable Moment Set.

Acheson, Michael J.↗

NASA NTRSDate not supplied

A Comparison of Control Allocation Methods in the Presence of Parametric Model Uncertainty

When allocating redundant effectors to virtual control commands, linear (generalized inverse) allocators have historically been used on aircraft and spacecraft. While simple to implement, generalized inverses are unable to realize a significant portion of the attainable moments. To address this drawback, the control allocation problem can also be formulated as a linear programming or quadratic programming problem and solved using convex optimization based solvers. These approaches have been shown to access a larger set of attainable moments, however, little work has been done to understand the performance of convex optimization-based control allocation in the presence of parametric model uncertainty. This paper seeks to compare the performance of several control allocation approaches, including two forms of generalized inverse allocators, the pseudo inverse and minimum-variance, and the linear programming and quadratic programming approach in the presence of parametric model uncertainty. The performance of these four allocators were tested on an aircraft model in the presence of realistic parametric model uncertainty and the convex optimization approaches were shown to outperform the generalized inverses.

Luke J Miller↗

DOE OSTI2014

Constant time worker thread allocation via configuration caching

Mechanisms are provided for allocating threads for execution of a parallel region of code. A request for allocation of worker threads to execute the parallel region of code is received from a master thread. Cached thread allocation information identifying prior thread allocations that have been performed for the master thread are accessed. Worker threads are allocated to the master thread based on the cached thread allocation information. The parallel region of code is executed using the allocated worker threads.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Climate change increases carbon allocation to leaves in early leaf green-up

Global greening, characterized by an increase in leaf area index (LAI), implies an increase in foliar carbon (C). Whether this increase in foliar C under climate change is due to higher photosynthesis or to higher allocation of C to leaves remains unknown. Here, we explored the trends in foliar C accumulation and allocation during leaf green-up from 2000 to 2017 using satellite-derived LAI and solar-induced chlorophyll fluorescence (SIF) across the Northern Hemisphere. The accumulation of foliar C accelerated in the early green-up period due to both increased photosynthesis and higher foliar C allocation driven by climate change. In the late stage of green-up, however, we detected decreasing trends in foliar C accumulation and foliar C allocation. Such stage-dependent trends in the accumulation and allocation of foliar C are not represented in current terrestrial biosphere models. Further, our results highlight that a better representation of C allocation should be incorporated into models.

54 ENVIRONMENTAL SCIENCES↗