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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Data flow methods for dynamic system simulation - A CSSL-IV microcomputer network interface

A major problem in employing networks of microcomputers for the real-time simulation of complex systems is to allocate computational tasks to the various microcomputers in such a way that idle time and time lost in interprocess communication is minimized. The research reported in this paper is directed to the development of a software interface between a higher-level simulation language and a network of microcomputers. A CSSL-IV source program is translated to a data flow graph. This graph is then analyzed automatically so as to allocate computing tasks to the various processors.

Makoui, A.↗
NASA NTRS1985

Testing of 30-GHz low noise receivers

NASA-sponsored studies of the growth in communications traffic have indicated that the frequency spectrum allocated to fix-service satellites at the C and Ku bands will reach saturation by the early 1990's. The next higher frequency bands allocated for communications satellties are 27.5 to 30 GHz for the uplink and 17.7 to 20.2 GHz for the downlink. Current plans for developing satellite systems that use these bands include a NASA demonstration satellite (ACTS). One of the components identified as critical to the success of that mission is a 27.5 to 30 GHz satellite receiver. In response to that identification, NASA has sponsored the development of such a receiver to the proof-of-concept (POC) level. Design and fabrication of such POC model receivers was carried out under parallel contracts awarded to LNR Communications, Inc. of Hauppauge, New York and to ITT Defense Communications Division of Nutley, New Jersey. The most significant of the performance goals were a 5 db maximum noise figure, a 2.5 GHz passband, and e0 dB Rf to If gain. Following delivery of hardware from each of the contractors, an in-house test program was undertaken at NASA's Lewis Research Center in order to verify the contractor-reported performance and to provide a comparison of the two receivers under identical test conditions. The present paper reports the results of those tests.

Conroy, M. J.↗
NASA NTRS1985

Antarctic Meteorite Newsletter, Volume 8, Number 2

Requests for samples are welcomed from research scientists of all countries, regardless of their current state of funding for meteorite studies. All sample requests will be reviewed by the Meteorite Working Group (MWG), a peer-review committee that guides the collection, curation, allocation, and distribution of the U.S. Antarctic meteorites. Issurance of samples does not imply a commitment by any agency to fund the proposed research. Requests for financial support must be submitted separately to the appropriate funding agencies. As a matter of policy, U.S. Antarctic meteorites are the property of the National Science Foundation and all allocations are subject to recall.

Source record↗
NASA NTRS1986

A method for screening of plant species for space use

A cost-effective methodology which monitors numerous dynamic aspects of carbon assimilation and allocation kinetics in live, intact plants is discussed. Analogous methods can apply to nitrogen uptake and allocation. This methodology capitalizes on the special properties of the short-lived, positron-gamma emitting isotope C-11 especially when applied as CO2-11 in a special extended square wave (ESW) pattern. The 20.4 minute half-life allows for repeated or continuous experiments on the same plant over periods of minutes, hours, days, or weeks. The steady-state isotope equilibrium approached during the ESW experiments, and the parameters which can be analyzed by this technique are also direct results of that short half-life. Additionally, the paired .511 MeV gamma rays penetrate any amount of tissue and their 180 deg opposite orientation provides good collimation and allows coincidence counting which nearly eliminates background.

Goeschl, J. D.↗
NASA NTRS1986

Testing of 30-GHz low noise receivers

NASA-sponsored studies of the growth in communications traffic have indicated that the frequency spectrum allocated to fix-service satellites at the C and Ku bands will reach saturation by the early 1990's. The next higher frequency bands allocated for communications satellites are 27.5 to 30 GHz for the uplink and 17.7 to 20.2 GHz for the downlink. Current plans for developing satellite systems that use these bands include a NASA demonstration satellite (ACTS). One of the components identified as critical to the success of that mission is a 27.5 to 30 GHz satellite receiver. In response to that identification, NASA has sponsored the development of such a receiver to the proof-of-concept (POC) level. Design and fabrication of such POC model receivers was carried out under parallel contracts awarded to LNR Communications, Inc. of Hauppauge, New York and to ITT Defense Communications Division of Nutley, New Jersey. The most significant of the performance goals were a 5 dB maximum noise figure, a 2.5 GHz passband, and 20 dB RF to IF gain. Following delivery of hardware from each of the contractors, an in-house test program was undertaken at NASA's Lewis Research Center in order to verify the contractor-reported performance and to provide a comparison of the two receivers under identical test conditions. The present paper reports the results of those tests.

Conroy, M. J.↗
NASA NTRS1985

Can pilots time-share better than non-pilots?

The time-sharing ability of 12 male pilots and 12 male college students ranging in age from 18-36 are evaluated and compared. The subjects performed five pairs of dual tasks with varying degrees of structural similarity; the test procedures are described. The time-sharing efficiency and resource allocation optimality of the subjects are analyzed. The data reveal that the pilots and students display similar time-sharing performance; the degree of time-sharing efficiency decreases and resource allocation optimality increases with an increasing degree of structural similarity between the time-shared tasks.

Tsang, P. S.↗
NASA NTRS1986

Mature data transport and command management services for the Space Station

The duplex space/ground/space data services for the Space Station are described. The need to separate the uplink data service functions from the command functions is discussed. Command management is a process shared by an operation control center and a command management system and consists of four functions: (1) uplink data communications, (2) management of the on-board computer, (3) flight resource allocation and management, and (4) real command management. The new data service capabilities provided by microprocessors, ground and flight nodes, and closed loop and open loop capabilities are studied. The need for and functions of a flight resource allocation management service are examined. The system is designed so only users can access the system; the problems encountered with open loop uplink access are analyzed. The procedures for delivery of operational, verification, computer, and surveillance and monitoring data directly to users are reviewed.

Carper, R. D.↗
NASA NTRS1986

Alternative mathematical programming formulations for FSS synthesis

A variety of mathematical programming models and two solution strategies are suggested for the problem of allocating orbital positions to (synthesizing) satellites in the Fixed Satellite Service. Mixed integer programming and almost linear programming formulations are presented in detail for each of two objectives: (1) positioning satellites as closely as possible to specified desired locations, and (2) minimizing the total length of the geostationary arc allocated to the satellites whose positions are to be determined. Computational results for mixed integer and almost linear programming models, with the objective of positioning satellites as closely as possible to their desired locations, are reported for three six-administration test problems and a thirteen-administration test problem.

Reilly, C. H.↗
NASA NTRS1987

Mapping between parallel processor structures and programs

This paper reports some ongoing research efforts at Stanford in allocation of parallel processing resources. Both processor structures and program structures have their own characteristics. Resource allocation binds the two structures during program execution. The mapping problem determines what processor structure and program structure may be combined to obtain maximum speedup. Three approaches to this mapping problem are considered. Two important factors, granularity and interaction delay, are also considered. A new hierarchical approach to structure definition is outlined. Effective and efficient tools are necessary for the study of the mapping problem. A fast turn-around simulation environment developed for investigating partition strategies for distributed computations and a computationally efficient method to predict performance of parallel processor structures are described.

Ngai, Tin-Fook↗
NASA NTRS1988

Embedding triple-modular redundancy into a hypercube architecture

This paper describes an embedding of Triple Modular Redundancy (TMR) into a binary hypercube. The goal is to improve fault tolerance by masking any single-point faults. Each module of an application task is triplicated and executed in parallel on three nodes of a 2-dimensional subcube (Q2) of the hypercube. Each of these nodes also executes a voter process. The remaining node is used for message passing only. All outputs from the triplicated modules are voted on, and the voting results are transmitted to the appropriate destination. Thus, all interunit messages are also triplicated. We propose an embedding of TMR into a hypercube which can be implemented in a manner transparent to the application program. Subcubes are allocated so that the address space for the TMR units is also a hypercube. Hence, the subcube allocation and intermodule communication schemes are defined to be analogous to the schemes used in the nonredundant system. The embedded system is proven to mask all single-point faults.

Kiskis, Daniel L.↗
NASA NTRS1989

A two-phase methodology for technology selection and system design

A two-phase methodology that can be used to guide R&D managers in the evaluation and selection of competing technologies is presented. Deterministic multiattribute utility theory is used in the first phase to rank the technological alternatives; the example presented involves the evaluation of electric and hybrid passenger vehicles. In all, 39 individuals from eight automotive firms were interviewed to assess their risk preferences and attitudes toward the vehicle design. In the second phase, the decision-maker must allocate a fixed amount of resources to different projects for the technology selected, some of which may be undertaken in parallel, to maximize a given measure of performance. When parallel funding is pursued the best outcome is chosen. The problem is formulated as a probabilistic network and solved heuristically using Monte Carlo simulation. Results are presented for two decision-makers and three budget options. In each case, the heuristic finds the optimal allocation of funds.

Bard, Jonathan F.↗
NASA NTRS1990

A study on diagnosability of space station ECLSS

The use is demonstrated of the Multigraph Architecture (MGA) for studies on the Environment Control and Life Support System (ECLSS). The objective was the following: (1) to create an updated set of models of the Potable Water Subsystem (PWS) by using the graphical model building tools of the Multigraph Programming Environment (MPE); (2) to derive a real time alarm simulator from the models; and (3) to demonstrate the effects of sensor allocation on the diagnosability of the PWS. This work may serve as a preliminary study for the detailed analysis of the sensor allocation and diagnosability problems in the ECLSS.

Padalkar, S.↗
NASA NTRS1991

A distributed scheduling algorithm for heterogeneous real-time systems

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

Zeineldine, Osman↗
NASA NTRS1990

Applications of artificial intelligence to mission planning

The following subject areas are covered: object-oriented programming task; rule-based programming task; algorithms for resource allocation; connecting a Symbolics to a VAX; FORTRAN from Lisp; trees and forest task; software data structure conversion; software functionality modifications and enhancements; portability of resource allocation to a TI MicroExplorer; frontier of feasibility software system; and conclusions.

Ford, Donnie R.↗
NASA NTRS1990

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗
NASA NTRS1989

Finite solid representation of robot manipulation in three-dimensional geometric reasoning

Intelligence robotic system design involves sensor allocation and sensor data fusion. In the field of geometric reasoning, a fast and effective representation method is needed to determine the physical dimensions of the manipulator as well as the motion environment in sufficient detail. Due to the capability of current sensor technology, the integrity of the sensor information is location dependent and point-wise, line-wise and plane-wise in nature. In order to maneuver the robot by reasoning the environment, there is a minimum requirement of prior information for integrating the allocated sensor feedback. Some new theoretical developments of how to associate the number and the locations of the sensors with three-dimensional geometry of the robot and the motion environment is presented. The related collision avoidance problem (CAP) will be addressed as well.

Chen, Alexander Y. K.↗
NASA NTRS1991

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗
NASA NTRS1991

Slave finite element for non-linear analysis of engine structures. Volume 2: Programmer's manual and user's manual

The programming aspects of SFENES are described in the User's Manual. The information presented is provided for the installation programmer. It is sufficient to fully describe the general program logic and required peripheral storage. All element generated data is stored externally to reduce required memory allocation. A separate section is devoted to the description of these files thereby permitting the optimization of Input/Output (I/O) time through efficient buffer descriptions. Individual subroutine descriptions are presented along with the complete Fortran source listings. A short description of the major control, computation, and I/O phases is included to aid in obtaining an overall familiarity with the program's components. Finally, a discussion of the suggested overlay structure which allows the program to execute with a reasonable amount of memory allocation is presented.

Witkop, D. L.↗