Search NASA⌕ Search

SEARCH · Search NASA

Results for “ALLOCATIONS”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Dynamic resource allocation scheme for distributed heterogeneous computer systems

This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator.

Liu, Howard T.↗
NASA NTRS1991

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.↗
NASA NTRS1991

Electronic neural network for dynamic resource allocation

A VLSI implementable neural network architecture for dynamic assignment is presented. The resource allocation problems involve assigning members of one set (e.g. resources) to those of another (e.g. consumers) such that the global 'cost' of the associations is minimized. The network consists of a matrix of sigmoidal processing elements (neurons), where the rows of the matrix represent resources and columns represent consumers. Unlike previous neural implementations, however, association costs are applied directly to the neurons, reducing connectivity of the network to VLSI-compatible 0 (number of neurons). Each row (and column) has an additional neuron associated with it to independently oversee activations of all the neurons in each row (and each column), providing a programmable 'k-winner-take-all' function. This function simultaneously enforces blocking (excitatory/inhibitory) constraints during convergence to control the number of active elements in each row and column within desired boundary conditions. Simulations show that the network, when implemented in fully parallel VLSI hardware, offers optimal (or near-optimal) solutions within only a fraction of a millisecond, for problems up to 128 resources and 128 consumers, orders of magnitude faster than conventional computing or heuristic search methods.

Thakoor, A. P.↗
NASA NTRS1992

Dynamically-allocated multi-queue buffers for VLSI communication switches

Several buffer structures are discussed and compared in terms of implementation complexity, interswitch handshaking requirements, and their ability to deal with variations in traffic patterns and message lengths. A new design of buffers is presented that provide non-FIFO message handling and efficient storage allocation for variable size packets using linked lists managed by a simple on-chip controller. The new buffer design is evaluated by comparing it to several alternative designs in the context of a multistage interconnection network. The present modeling and simulations show that the new buffer outperforms alternative buffers and can thus be used to improve the performance of a wide variety of systems currently using less efficient buffers.

Tamir, Yuval↗
NASA NTRS1992

Allocations by the 1992 World Administrative Radio Conference

An overview of the 1992 World Administrative Radio Conference is presented with viewgraphs. Allocations of radio frequency spectrum are addressed. Mobile satellite service, broadcast satellite service, and uplink power control beacons are also addressed.

Heyward, Ann O.↗
NASA NTRS1992

Optimal routing and buffer allocation for a class of finite capacity queueing systems

The problem of routing jobs to K parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Routing decisions are taken by a controller which has buffering space available to it and may delay routing of a customer to a queue. Using ideas from weak majorization, it is shown that the shorter nonfull queue delayed (SNQD) policy minimizes both the total number of customers in the system at any time and the number of customers that are rejected by that time. The SNQD policy always delays routing decisions as long as all servers are busy. Only when all the buffers at the controller are occupied is a customer routed to the queue with the shortest queue length that is not at capacity. Moreover, it is shown that, if a fixed number of buffers is to be distributed among the K queues, then the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Towsley, Don↗
NASA NTRS1993

A minimum cost tolerance allocation method for rocket engines and robust rocket engine design

Rocket engine design follows three phases: systems design, parameter design, and tolerance design. Systems design and parameter design are most effectively conducted in a concurrent engineering (CE) environment that utilize methods such as Quality Function Deployment and Taguchi methods. However, tolerance allocation remains an art driven by experience, handbooks, and rules of thumb. It was desirable to develop and optimization approach to tolerancing. The case study engine was the STME gas generator cycle. The design of the major components had been completed and the functional relationship between the component tolerances and system performance had been computed using the Generic Power Balance model. The system performance nominals (thrust, MR, and Isp) and tolerances were already specified, as were an initial set of component tolerances. However, the question was whether there existed an optimal combination of tolerances that would result in the minimum cost without any degradation in system performance.

Gerth, Richard J.↗
NASA NTRS1995

Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads

Traditionally, allocation of data in distributed database management systems has been determined by off-line analysis and optimization. This technique works well for static database access patterns, but is often inadequate for frequently changing workloads. In this paper we address how to dynamically reallocate data for partionable distributed databases with changing access patterns. Rather than complicated and expensive optimization algorithms, a simple heuristic is presented and shown, via an implementation study, to improve system throughput by 30 percent in a local area network based system. Based on artificial wide area network delays, we show that dynamic reallocation can improve system throughput by a factor of two and a half for wide area networks. We also show that individual site load must be taken into consideration when reallocating data, and provide a simple policy that incorporates load in the reallocation decision.

Brunstrom, Anna↗
NASA NTRS1993

The Stimulus Movement Effect: Allocation of Attention or Artifact?

In previous reports, including one by the author, learning has been shown to benefit by having discriminanda move rather than remain stationary. This stimulus movement effect might be attributed to several theoretical mechanisms, including attention, topological memory, and exposure duration. The series of experiments reported in this article was designed to Contrast these potential explanatory factors. Ten rhesus monkeys (Macaca mulatta) were tested on a variety of computerized tasks in which the stimuli remained stationary, flashed, or moved at systematically varied speeds. Performance was significantly best when the sample stimulus moved quickly and was poorest when the stimulus remained stationary. Further analysis of these data and other previously published data revealed that the distribution of the stimulus movement effect across trials supported an attention allocation interpretation.

Washburn, David A.↗
NASA NTRS1999

Robust Passification via Optimal Sensor Blending and Control Allocation

Robust passification is considered for uncertain linear, time invariant, systems having redundant actuators and sensors. The approach is to obtain optimal sensor blending and control allocation matrices that maximize the region in the parameter space in which the system remains passive. The approach results in a generalized eigenvalue problem consisting of a number of linear matrix inequalities (LMIs). Reduction of the number of LMIs is investigated, and a numerical example is given for demonstrating the approach.

Joshi, S. M.↗
NASA NTRS1999

Robust Passification via Optimal Sensor Blending and Control Allocation

Robust passification is considered for uncertain linear, time invariant systems having redundant actuators and sensors. The approach is to obtain optimal sensor blending and control allocation matrices that maximize the region in the parameter space in which the system remains passive. The approach results in a generalized eigenvalue problem consisting of a number of linear matrix inequalities (LMIs). Reduction of the number of LMIs is investigated, and a numerical example is given for demonstrating the approach.

Joshi, S. M.↗
NASA NTRS2000

Microwave Driven Actuators Power Allocation and Distribution

Design, fabrication and test of a power allocation and distribution (PAD) network for microwave driven actuators is presented in this paper. Development of a circuit that would collect power from a rectenna array amplify and distribute the power to actuators was designed and fabricated for space application in an actuator array driven by a microwave. A P-SPICE model was constructed initially for data reduction purposes, and was followed by a working real-world model. A voltage up - converter (VUC) is used to amplify the voltage from the individual rectenna. The testing yielded a 26:1 voltage amplification ratio with input voltage at 9 volts and a measured output voltage 230VDC. Future work includes the miniaturization of the circuitry, the use of microwave remote control, and voltage amplification technology for each voltage source. The objective of this work is to develop a model system that will collect DC voltage from an array of rectenna and propagate the voltage to an array of actuators.

Forbes, Timothy↗
NASA NTRS2001

Empirical Analysis of EEG and ERPs for Psychophysiological Adaptive Task Allocation

The present study was designed to test the efficacy of using Electroencephalogram (EEG) and Event-Related Potentials (ERPs) for making task allocation decisions. Thirty-six participants were randomly assigned to an experimental, yoked, or control group condition. Under the experimental condition, a tracking task was switched between task modes based upon the participant's EEG. The results showed that the use of adaptive aiding improved performance and lowered subjective workload under negative feedback as predicted. Additionally, participants in the adaptive group had significantly lower RMSE and NASA-TLX ratings than participants in either the yoked or control group conditions. Furthermore, the amplitudes of the N1 and P3 ERP components were significantly larger under the experimental group condition than under either the yoked or control group conditions. These results are discussed in terms of the implications for adaptive automation design.

Prinzel, Lawrence J., III↗
NASA NTRS2002

Transcriptional control of monolignol biosynthesis in Pinus taeda: factors affecting monolignol ratios and carbon allocation in phenylpropanoid metabolism

Transcriptional profiling of the phenylpropanoid pathway in Pinus taeda cell suspension cultures was carried out using quantitative real time PCR analyses of all known genes involved in the biosynthesis of the two monolignols, p-coumaryl and coniferyl alcohols (lignin/lignan precursors). When the cells were transferred to a medium containing 8% sucrose and 20 mm potassium iodide, the monolignol/phenylpropanoid pathway was induced, and transcript levels for phenylalanine ammonia lyase, cinnamate 4-hydroxylase, p-coumarate 3-hydroxylase, 4-coumarate:CoA ligase, caffeoyl-CoA O-methyltransferase, cinnamoyl-CoA reductase, and cinnamyl alcohol dehydrogenase were coordinately up-regulated. Provision of increasing levels of exogenously supplied Phe to saturating levels (40 mm) to the induction medium resulted in further up-regulation of their transcript levels in the P. taeda cell cultures; this in turn was accompanied by considerable increases in both p-coumaryl and coniferyl alcohol formation and excretion. By contrast, transcript levels for both cinnamate 4-hydroxylase and p-coumarate 3-hydroxylase were only slightly up-regulated. These data, when considered together with metabolic profiling results and genetic manipulation of various plant species, reveal that carbon allocation to the pathway and its differential distribution into the two monolignols is controlled by Phe supply and differential modulation of cinnamate 4-hydroxylase and p-coumarate 3-hydroxylase activities, respectively. The coordinated up-regulation of phenylalanine ammonia lyase, 4-coumarate:CoA ligase, caffeoyl-CoA O-methyltransferase, cinnamoyl-CoA reductase and cinnamyl alcohol dehydrogenase in the presence of increasing concentrations of Phe also indicates that these steps are not truly rate-limiting, because they are modulated according to metabolic demand. Finally, the transcript profile of a putative acid/ester O-methyltransferase, proposed as an alternative catalyst for O-methylation leading to coniferyl alcohol, was not up-regulated under any of the conditions employed, suggesting that it is not, in fact, involved in monolignol biosynthesis.

NASA Discipline Plant Biology↗
NASA NTRS1987

Nodule activity and allocation of photosynthate of soybean during recovery from water stress

Nodulated soybean plants (Glycine max [L.] Merr. cv Ransom) in a growth-chamber study were subjected to a leaf water potential (psi w) of -2.0 megapascal during vegetative growth. Changes in nonstructural carbohydrate contents of leaves, stems, roots, and nodules, allocation of dry matter among plant parts, in situ specific nodule activity, and in situ canopy apparent photosynthetic rate were measured in stressed and nonstressed plants during a 7-day period following rewatering. Leaf and nodule psi w also were determined. At the time of maximum stress, concentration of nonstructural carbohydrates had declined in leaves of stressed, relative to nonstressed, plants, and the concentration of nonstructural carbohydrates had increased in stems, roots, and nodules. Sucrose concentrations in roots and nodules of stressed plants were 1.5 and 3 times greater, respectively, than those of nonstressed plants. Within 12 hours after rewatering, leaf and nodule psi w of stressed plants had returned to values of nonstressed plants. Canopy apparent photosynthesis and specific nodule activity of stressed plants recovered to levels for nonstressed plants within 2 days after rewatering. The elevated sucrose concentrations in roots and nodules of stressed plants also declined rapidly upon rehydration. The increase in sucrose concentration in nodules, as well as the increase of carbohydrates in roots and stems, during water stress and the rapid disappearance upon rewatering indicates that inhibition of carbohydrate utilization within the nodule may be associated with loss of nodule activity. Availability of carbohydrates within the nodules and from photosynthetic activity following rehydration of nodules may mediate the rate of recovery of N2-fixation activity.

Non-NASA Center↗
NASA NTRS2006

Beyond Population and Environment: Household Life Cycle Demography and Land Use Allocation among Small Farm Colonists in the Amazon

Most research featuring demographic factors in environmental change has focused on processes operating at the level of national or global populations. This paper focuses on household-level demographic life cycles among colonists in the Amazon, and evaluates the impacts on land use allocation. The analysis goes beyond prior research by including a broader suite of demographic variables, and by simultaneously assessing their impacts on multiple land uses with different economic and ecological implications. We estimate a system of structural equations that accounts for endogeneity among land uses, and the findings indicate stronger demographic effects than previous work. These findings bear implications for modeling land use, and the place of demography in environmental research.

Perz, Stephen G.↗
NASA NTRS2007

Algorithm Optimally Allocates Actuation of a Spacecraft

A report presents an algorithm that solves the following problem: Allocate the force and/or torque to be exerted by each thruster and reaction-wheel assembly on a spacecraft for best performance, defined as minimizing the error between (1) the total force and torque commanded by the spacecraft control system and (2) the total of forces and torques actually exerted by all the thrusters and reaction wheels. The algorithm incorporates the matrix vector relationship between (1) the total applied force and torque and (2) the individual actuator force and torque values. It takes account of such constraints as lower and upper limits on the force or torque that can be applied by a given actuator. The algorithm divides the aforementioned problem into two optimization problems that it solves sequentially. These problems are of a type, known in the art as semi-definite programming problems, that involve linear matrix inequalities. The algorithm incorporates, as sub-algorithms, prior algorithms that solve such optimization problems very efficiently. The algorithm affords the additional advantage that the solution requires the minimum rate of consumption of fuel for the given best performance.

Motaghedi, Shi↗
NASA NTRS2007

Collaborative Resource Allocation

Collaborative Resource Allocation Networking Environment (CRANE) Version 0.5 is a prototype created to prove the newest concept of using a distributed environment to schedule Deep Space Network (DSN) antenna times in a collaborative fashion. This program is for all space-flight and terrestrial science project users and DSN schedulers to perform scheduling activities and conflict resolution, both synchronously and asynchronously. Project schedulers can, for the first time, participate directly in scheduling their tracking times into the official DSN schedule, and negotiate directly with other projects in an integrated scheduling system. A master schedule covers long-range, mid-range, near-real-time, and real-time scheduling time frames all in one, rather than the current method of separate functions that are supported by different processes and tools. CRANE also provides private workspaces (both dynamic and static), data sharing, scenario management, user control, rapid messaging (based on Java Message Service), data/time synchronization, workflow management, notification (including emails), conflict checking, and a linkage to a schedule generation engine. The data structure with corresponding database design combines object trees with multiple associated mortal instances and relational database to provide unprecedented traceability and simplify the existing DSN XML schedule representation. These technologies are used to provide traceability, schedule negotiation, conflict resolution, and load forecasting from real-time operations to long-range loading analysis up to 20 years in the future. CRANE includes a database, a stored procedure layer, an agent-based middle tier, a Web service wrapper, a Windows Integrated Analysis Environment (IAE), a Java application, and a Web page interface.

Wang, Yeou-Fang↗