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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1970

An adaptive approach to the dynamic allocation of buffer storage

Several strategies for the dynamic allocation of buffer storage are simulated and compared. The basic algorithms investigated, using actual statistics observed in the Univac 1108 EXEC 8 System, include the buddy method and the first-fit method. Modifications are made to the basic methods in an effort to improve and to measure allocation performance. A simulation model of an adaptive strategy is developed which permits interchanging the two different methods, the buddy and the first-fit methods with some modifications. Using an adaptive strategy, each method may be employed in the statistical environment in which its performance is superior to the other method.

Crooke, S. C.↗
NASA NTRS1971

Methodologies for optimal resource allocation to the national space program and new space utilizations. Volume 1: Technical description

The optimal allocation of resources to the national space program over an extended time period requires the solution of a large combinatorial problem in which the program elements are interdependent. The computer model uses an accelerated search technique to solve this problem. The model contains a large number of options selectable by the user to provide flexible input and a broad range of output for use in sensitivity analyses of all entering elements. Examples of these options are budget smoothing under varied appropriation levels, entry of inflation and discount effects, and probabilistic output which provides quantified degrees of certainty that program costs will remain within planned budget. Criteria and related analytic procedures were established for identifying potential new space program directions. Used in combination with the optimal resource allocation model, new space applications can be analyzed in realistic perspective, including the advantage gain from existing space program plant and on-going programs such as the space transportation system.

Source record↗
NASA NTRS1976

Solving the optimal attention allocation problem in manual control

Within the context of the optimal control model of human response, analytic expressions for the gradients of closed-loop performance metrics with respect to human operator attention allocation are derived. These derivatives serve as the basis for a gradient algorithm that determines the optimal attention that a human should allocate among several display indicators in a steady-state manual control task. Application of the human modeling techniques are made to study the hover control task for a CH-46 VTOL flight tested by NASA.

Kleinman, D. L.↗
NASA NTRS1977

Error rate information in attention allocation pilot models

The Northrop urgency decision pilot model was used in a command tracking task to compare the optimized performance of multiaxis attention allocation pilot models whose urgency functions were (1) based on tracking error alone, and (2) based on both tracking error and error rate. A matrix of system dynamics and command inputs was employed, to create both symmetric and asymmetric two axis compensatory tracking tasks. All tasks were single loop on each axis. Analysis showed that a model that allocates control attention through nonlinear urgency functions using only error information could not achieve performance of the full model whose attention shifting algorithm included both error and error rate terms. Subsequent to this analysis, tracking performance predictions for the full model were verified by piloted flight simulation. Complete model and simulation data are presented.

Faulkner, W. H.↗
NASA NTRS1984

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

Criteria for site selection and frequency allocation (keynote paper), part 5

Technical aspects of mesosphere-stratosphere-troposphere (MST) Radar on site and frequency selection were discussed. Recommendations on site selections are presented. Tests of interference will be conducted before selecting a site. A small directional antenna may be suitable to simulate sidelobe sensitivity of radars however, sophisticated data-processing methods make system sensitivity extremely good. The use of the complete data system to look for interference is recommended. There is the difficulty of allocation of frequencies -- almost continuous use by these radars will be made when the band 40 to 60 MHz is allocated to other services.

Rottger, J.↗
NASA NTRS1986

Knowledge-based load leveling and task allocation in human-machine systems

Conventional human-machine systems use task allocation policies which are based on the premise of a flexible human operator. This individual is most often required to compensate for and augment the capabilities of the machine. The development of artificial intelligence and improved technologies have allowed for a wider range of task allocation strategies. In response to these issues a Knowledge Based Adaptive Mechanism (KBAM) is proposed for assigning tasks to human and machine in real time, using a load leveling policy. This mechanism employs an online workload assessment and compensation system which is responsive to variations in load through an intelligent interface. This interface consists of a loading strategy reasoner which has access to information about the current status of the human-machine system as well as a database of admissible human/machine loading strategies. Difficulties standing in the way of successful implementation of the load leveling strategy are examined.

Chignell, M. H.↗
NASA NTRS1986

Optimal allocation of file servers in a local network environment

Files associated with workstations in a local area network are to be allocated among two or more file servers. Assuming statistically identical workstations and file servers and a performance model which is a closed multiclass separable queueing network, an optimal allocation is found. It is shown that all the files of each workstation should be placed on one file server, with the workstations divided as equally as possible among the file servers.

Woodside, C. M.↗
NASA NTRS1986

Analysis of memory use for improved design and compile-time allocation of local memory

Trace analysis techniques are used to study memory referencing behavior for the purpose of designing local memories and determining how to allocate them for data and instructions. In an attempt to assess the inherent behavior of the source code, the trace analysis system described here reduced the effects of the compiler and host architecture on the trace by using a technical called flattening. The variables in the trace, their associated single-assignment values, and references are histogrammed on the basis of various parameters describing memory referencing behavior. Bounds are developed specifying the amount of memory space required to store all live values in a particular histogram class. The reduction achieved in main memory traffic by allocating local memory is specified for each class.

Mcniven, Geoffrey D.↗
NASA NTRS1990

Neural-Network Processor Would Allocate Resources

Global optimization problems solved quickly. Neural-network processor optimizes allocation of M resources among N expenditures according to cost of pairing each resource with each expenditure and subject to limit on number of resources feeding into each expenditure and/or limit on number of expenditures to which each resource allocated. One cell performs several analog and digital functions. Potential applications include assignment of jobs, scheduling, dispatching, and planning of military maneuvers.

Eberhardt, Silvio P.↗
NASA NTRS1990

Space Station Freedom resource allocation accommodation of technology payload requirements

An overview of the Office of Aeronautics, Exploration, and Technology (OAET) Space Station Freedom Technology Payload Development Program is provided, and the OAET Station resource requirements are reviewed. The requirements are contrasted with current proposed resource allocations. A discussion of the issues and conclusions are provided. It is concluded that an overall 20 percent resource allocation is appropriate to support OAET's technology development program, that some resources are inadequate even at the 20 percent level, and that bartering resources among U.S. users and international partners and increasing the level of automation may be viable solutions to the resource constraint problem.

Avery, Don E.↗
NASA NTRS1992

Software For Allocation Of Tolerances

Collection of computer programs being developed to assist engineers in allocating tolerances to dimensions of components and assemblies. System reflects tolerancing expertise of design and manufacturing engineers; helps engineers maintain comprehensive tolerancing policy and overview that might otherwise get lost when attending to details of design and manufacturing processes. Necessary to allocate tolerances for three main reasons: tolerances allow for variations in dimensions of components as manufactured; assembly of two or more components, dimensions lie between specified limits; and part replaced must fit in place.

Fernandez, Ken↗
NASA NTRS1992

Constrained control allocation

This paper addresses the problem of the allocation of several flight controls to the generation of specified body-axis moments. The number of controls is greater than the number of moments being controlled, and the ranges of the controls are constrained to certain limits. The controls are assumed to be individually linear in their effect throughout their ranges of motion, and independent of one another in their effects. The geometries of the subset of the constrained controls and of its image in moment space are examined. A direct method of allocating these several controls is presented, that guarantees the maximum possible moment is generated within the constraints of the controls. The results are illustrated by an example problem involving three controls and two moments.

Durham, Wayne C.↗
NASA NTRS1993

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗
NASA NTRS1993

Thematic Mapper data for forest resource allocation

A technique for classifying a Landsat Thematic Mapper image was demonstrated on the Wayne National Forest of southeastern Ohio. The classified image was integrated into a geographic information system database, and prescriptive forest land use allocation models were developed using the techniques of cartographic modeling. Timber harvest sites and accompanying haul roads were allocated.

Zeff, Ilene S.↗
NASA NTRS1994

Low-Earth-Orbiter resource allocation and capacity planning for the DSN using LEO4CAST

The Deep Space Network provides tracking and communication services for a number of U.S. and international low-Earth-orbiting (LEO) and near-Earth missions. This service is supplied by the 26-m subnet (located at each of the DSN complexes), the 9-m and the 34-m Antenna Research System antennas at Goldstone, and the 11-m antennas (following the orbital VLBI mission). An increasing number of LEO missions are planned for DSN support, which will result in increasingly complex ground resource allocation and mission support trades. To support TDA decision making on mission support and cost-effective ground system evolution for this 26-m subnet, LEO4CAST has been developed. LEO4CAST is a tool that uses statistical approaches to provide useful information for long-term ground system capacity planning and near-term resource allocation (prior to detailed time-of-day scheduling). LEO4CAST is currently beta-test software and is being exercised by both the Office of Telecommunications and Data Acquisition (TDA) and the JPL Systems Division.

Fox, G.↗
NASA NTRS1992

Generation and Exploitation of Aggregation Abstractions for Scheduling and Resource Allocation

Our research is investigating abstraction of computational theories for scheduling and resource allocation. These theories are represented in a variant of first order predicate calculus, parameterized multisorted logic, that facilitates specification of large problems. A particular problem is conceptually stated as a set of ground sentences that are consistent with a quantified theory. We are mainly investigating the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. We are also investigating the interaction of aggregation abstractions with the more thoroughly investigated abstractions of weakening operator preconditions. The purpose of the theories for aggregated demand/capacity is threefold: first, to answer queries about aggregate properties, such as gross feasibility; second, to reduce computational costs by using the solution of aggregate problems to guide the solution of detailed problems; and third, to facilitate reformulating theories to approximate problems for which there are efficient problem solving methods. We also describe novel methods for exploiting aggregation abstractions.

Linden, Theodore A.↗