Results for “Computational demand” — Page 5

NASA NTRS2001

The Need for Optical Means as an Alternative for Electronic Computing

An increasing demand for faster computers is rapidly growing to encounter the fast growing rate of Internet, space communication, and robotic industry. Unfortunately, the Very Large Scale Integration technology is approaching its fundamental limits beyond which the device will be unreliable. Optical interconnections and optical integrated circuits are strongly believed to provide the way out of the extreme limitations imposed on the growth of speed and complexity of nowadays computations by conventional electronics. This paper demonstrates two ultra-fast, all-optical logic gates and a high-density storage medium, which are essential components in building the future optical computer.

Adbeldayem, Hossin↗

NASA NTRS1992

Overview on Basis and Use of Performance Prediction Methods

The lecture outlines the basic methods of component matching which are central to the prediction of gas turbine performance. Steady state prediction of off-design performance must be done at the beginning of an engine development program, to ensure that the engine can satisfy all the mission requirements. The matching techniques can be extended to predict transient performance, which is essential for controls development and to ensure good engine handling. The large amount of computation required demands the use of computer modelling and the role of modelling in the development program and the basic requirements for performance modelling are described.

H I H Saravanamuttoo↗

NASA NTRS1999

Implementation of Multispectral Image Classification on a Remote Adaptive Computer

As the demand for higher performance computers for the processing of remote sensing science algorithms increases, the need to investigate new computing paradigms its justified. Field Programmable Gate Arrays enable the implementation of algorithms at the hardware gate level, leading to orders of m a,gnitude performance increase over microprocessor based systems. The automatic classification of spaceborne multispectral images is an example of a computation intensive application, that, can benefit from implementation on an FPGA - based custom computing machine (adaptive or reconfigurable computer). A probabilistic neural network is used here to classify pixels of of a multispectral LANDSAT-2 image. The implementation described utilizes Java client/server application programs to access the adaptive computer from a remote site. Results verify that a remote hardware version of the algorithm (implemented on an adaptive computer) is significantly faster than a local software version of the same algorithm implemented on a typical general - purpose computer).

Figueiredo, Marco A.↗

NASA NTRS1971

Remote Sensing of Snow Fields from Earth Satellites

Considerable effort has gone into snow line delineation using available satellite data. Furthermore, increasing emphasis is being put on automated extraction of such information and generation of a useable product for hydrologists. Implications are clear that the impact from future satellite and sensors systems will create an increased demand for computer processing before the data can be used by the hydrologist. If the coarse-resolution, broad spectral band data available from current satellites already create a demand by hydrologists for computer processing of the data, it is obvious there will be an even greater demand for computer analysis and evaluation when the future ERTS data become available.

Baker, D. R.↗

NASA NTRS1988

Dynamic remapping of parallel computations with varying resource demands

The issue of deciding when to invoke a global load remapping mechanism is studied. Such a decision policy must effectively weigh the costs of remapping against the performance benefits, and should be general enough to apply automatically to a wide range of computations. The authors propose a general mapping decision heuristic, then study its effectiveness and its anticipated behavior on two very different models of load evolution. Assuming only that the remapping cost is known, this policy dynamically minimizes system degradation (including the cost of remapping) for each computation step. This policy is quite simple, choosing to remap when the first local minimum in the degradation function is detected. Simulations show that the decision obtained provides significantly better performance than that achieved by never remapping. The authors also observe that the average intermapping frequency is quite close to the optimal fixed remapping frequency.

Nicol, David M.↗

NASA NTRS1978

Gigaflop architecture, a hardware perspective

Any super computer built in the early 1980s will use components that are available by fall 1978. The architecture of such a system cannot depart radically from current super computers if the software experience painfully acquired from these computers in the 70's is to apply. Given the above constraints, 10 billion floating point operations per second (BFLOPS) are attainable and a problem memory of 512 million (64 bit) words could be supported by the technology of the time. In contrast to this, industry is likely to respond with commercially available machines with a performance of less than 150 MFLOPS. This is due to self-imposed constraints on the manufacturers to provide upward compatible architectures (same instruction set) and systems which can be sold in significant volumes. Since this computing speed is inadequate to meet the demands of computational fluid dynamics, a special processor is required. Issues which are felt to be significant in the pursuit of maximum compute capability in this special processor are discussed.

Feierbach, G. F.↗

NASA NTRS1985

Reliability models for dataflow computer systems

The demands for concurrent operation within a computer system and the representation of parallelism in programming languages have yielded a new form of program representation known as data flow (DENN 74, DENN 75, TREL 82a). A new model based on data flow principles for parallel computations and parallel computer systems is presented. Necessary conditions for liveness and deadlock freeness in data flow graphs are derived. The data flow graph is used as a model to represent asynchronous concurrent computer architectures including data flow computers.

Kavi, K. M.↗

NASA NTRS1980

Computer program documentation: ODRC demand plotting program user's guide

The Orbital Data Reduction Center (ODRC) Demand Plotting Program provides the user with three main options, each of which provides the additional option of generating a numerical summary and/or plots for the Measurement ID's (MID) on the Measurement Node Correlation (MNC) list. Option one reads MID data from word addressable ODRC files, stores the data on a temporary file, and uses it to build the numerical summary and/or plots, according to user input instructions. Options two and three read MID data from a word addressable ODRC file and component node data from a word addressable HSTFLO or HISTRY file. The component node data is used to calculate a predicted MID. Then, for option two, the MID and predicted MID data is used to generate a numerical summary and/or plots. For option three, the component node data itself is used in generating the numerical summary and/or plots. The numerical summary is sent to the BRKPT file, RELOCOK, and can be viewed after the execution of the program using the edit mode to find the desired section of the summary.

Damico, S. J.↗

NASA NTRS2003

Changing the Paradigm: Preparing Students for the Computing Profession in the 21st Century

The dramatic technological developments of the past decade have led to a tremendous growth in the demand for computer science professionals well-versed in advanced technology and techniques. NASA, traditionally a haven for cutting-edge innovators, is now competing with every industrial and government sector for computer science talent. The computer science program at University of Texas at San Antonio (UTSA) faces challenges beyond those intrinsically presented by rapid technological change, because a significant number of UTSA students come from low-income families with no Internet or computer access at home. An examination of enrollment statistics for the computer science program at UTSA showed that very few students who entered as freshmen successfully graduated. The upper division courses appeared to be populated by graduate students removing deficiencies and by transfer students. The faculty was also concerned that the students who did graduate from the program did not have the strong technical and programming skills that the CS program had been noted for in the community during the 1980's.

Robbins, Kay A.↗

NASA NTRS1980

Evolution of a standard microprocessor-based space computer

An existing in inventory computer hardware/software package (B-1 RFS/ECM) was repackaged and applied to multiple missile/space programs. Concurrent with the application efforts, low risk modifications were made to the computer from program to program to take advantage of newer, advanced technology and to meet increasingly more demanding requirements (computational and memory capabilities, longer life, and fault tolerant autonomy). It is concluded that microprocessors hold promise in a number of critical areas for future space computer applications. However, the benefits of the DoD VHSIC Program are required and the old proliferation problem must be revised.

Fernandez, M.↗

NASA NTRS1987

Reduced complexity structural modeling for automated airframe synthesis

A procedure is developed for the optimum sizing of wing structures based on representing the built-up finite element assembly of the structure by equivalent beam models. The reduced-order beam models are computationally less demanding in an optimum design environment which dictates repetitive analysis of several trial designs. The design procedure is implemented in a computer program requiring geometry and loading information to create the wing finite element model and its equivalent beam model, and providing a rapid estimate of the optimum weight obtained from a fully stressed design approach applied to the beam. The synthesis procedure is demonstrated for representative conventional-cantilever and joined wing configurations.

Hajela, Prabhat↗

NASA NTRS2009

Physical Principle for Generation of Randomness

A physical principle (more precisely, a principle that incorporates mathematical models used in physics) has been conceived as the basis of a method of generating randomness in Monte Carlo simulations. The principle eliminates the need for conventional random-number generators. The Monte Carlo simulation method is among the most powerful computational methods for solving high-dimensional problems in physics, chemistry, economics, and information processing. The Monte Carlo simulation method is especially effective for solving problems in which computational complexity increases exponentially with dimensionality. The main advantage of the Monte Carlo simulation method over other methods is that the demand on computational resources becomes independent of dimensionality. As augmented by the present principle, the Monte Carlo simulation method becomes an even more powerful computational method that is especially useful for solving problems associated with dynamics of fluids, planning, scheduling, and combinatorial optimization. The present principle is based on coupling of dynamical equations with the corresponding Liouville equation. The randomness is generated by non-Lipschitz instability of dynamics triggered and controlled by feedback from the Liouville equation. (In non-Lipschitz dynamics, the derivatives of solutions of the dynamical equations are not required to be bounded.)

Zak, Michail↗

NASA NTRS1982

Computational fluid dynamics - The coming revolution

The development of aerodynamic theory is traced from the days of Aristotle to the present, with the next stage in computational fluid dynamics dependent on superspeed computers for flow calculations. Additional attention is given to the history of numerical methods inherent in writing computer codes applicable to viscous and inviscid analyses for complex configurations. The advent of the superconducting Josephson junction is noted to place configurational demands on computer design to avoid limitations imposed by the speed of light, and a Japanese projection of a computer capable of several hundred billion operations/sec is mentioned. The NASA Numerical Aerodynamic Simulator is described, showing capabilities of a billion operations/sec with a memory of 240 million words using existing technology. Near-term advances in fluid dynamics are discussed.

Graves, R. A., Jr.↗

NASA NTRS2006

NAS Demand Predictions, Transportation Systems Analysis Model (TSAM) Compared with Other Forecasts

The current work incorporates the Transportation Systems Analysis Model (TSAM) to predict the future demand for airline travel. TSAM is a multi-mode, national model that predicts the demand for all long distance travel at a county level based upon population and demographics. The model conducts a mode choice analysis to compute the demand for commercial airline travel based upon the traveler s purpose of the trip, value of time, cost and time of the trip,. The county demand for airline travel is then aggregated (or distributed) to the airport level, and the enplanement demand at commercial airports is modeled. With the growth in flight demand, and utilizing current airline flight schedules, the Fratar algorithm is used to develop future flight schedules in the NAS. The projected flights can then be flown through air transportation simulators to quantify the ability of the NAS to meet future demand. A major strength of the TSAM analysis is that scenario planning can be conducted to quantify capacity requirements at individual airports, based upon different future scenarios. Different demographic scenarios can be analyzed to model the demand sensitivity to them. Also, it is fairly well know, but not well modeled at the airport level, that the demand for travel is highly dependent on the cost of travel, or the fare yield of the airline industry. The FAA projects the fare yield (in constant year dollars) to keep decreasing into the future. The magnitude and/or direction of these projections can be suspect in light of the general lack of airline profits and the large rises in airline fuel cost. Also, changes in travel time and convenience have an influence on the demand for air travel, especially for business travel. Future planners cannot easily conduct sensitivity studies of future demand with the FAA TAF data, nor with the Boeing or Airbus projections. In TSAM many factors can be parameterized and various demand sensitivities can be predicted for future travel. These resulting demand scenarios can be incorporated into future flight schedules, therefore providing a quantifiable demand for flights in the NAS for a range of futures. In addition, new future airline business scenarios are investigated that illustrate when direct flights can replace connecting flights and larger aircraft can be substituted, only when justified by demand.

Viken, Jeff↗

NASA NTRS2006

Utilizing Traveler Demand Modeling to Predict Future Commercial Flight Schedules in the NAS

The current work incorporates the Transportation Systems Analysis Model (TSAM) to predict the future demand for airline travel. TSAM is a multi-mode, national model that predicts the demand for all long distance travel at a county level based upon population and demographics. The model conducts a mode choice analysis to compute the demand for commercial airline travel based upon the traveler s purpose of the trip, value of time, cost and time of the trip,. The county demand for airline travel is then aggregated (or distributed) to the airport level, and the enplanement demand at commercial airports is modeled. With the growth in flight demand, and utilizing current airline flight schedules, the Fratar algorithm is used to develop future flight schedules in the NAS. The projected flights can then be flown through air transportation simulators to quantify the ability of the NAS to meet future demand. A major strength of the TSAM analysis is that scenario planning can be conducted to quantify capacity requirements at individual airports, based upon different future scenarios. Different demographic scenarios can be analyzed to model the demand sensitivity to them. Also, it is fairly well know, but not well modeled at the airport level, that the demand for travel is highly dependent on the cost of travel, or the fare yield of the airline industry. The FAA projects the fare yield (in constant year dollars) to keep decreasing into the future. The magnitude and/or direction of these projections can be suspect in light of the general lack of airline profits and the large rises in airline fuel cost. Also, changes in travel time and convenience have an influence on the demand for air travel, especially for business travel. Future planners cannot easily conduct sensitivity studies of future demand with the FAA TAF data, nor with the Boeing or Airbus projections. In TSAM many factors can be parameterized and various demand sensitivities can be predicted for future travel. These resulting demand scenarios can be incorporated into future flight schedules, therefore providing a quantifiable demand for flights in the NAS for a range of futures. In addition, new future airline business scenarios are investigated that illustrate when direct flights can replace connecting flights and larger aircraft can be substituted, only when justified by demand.

Viken, Jeff↗

NASA NTRS1987

Computational analysis of hypersonic airbreathing aircraft flow fields

The general problem of calculating the flow fields associated with hypersonic airbreathing aircraft is presented. Unique aspects of hypersonic aircraft aerodynamics are introduced and their demands on computational fluid dynamics are outlined. Example calculations associated with inlet/forebody integration and hypersonic nozzle design are presented to illustrate the nature of the problems considered.

Dwoyer, Douglas L.↗

NASA NTRS1993

Radiation and scattering by cavity-backed antennas on a circular cylinder

Conformal arrays are popular antennas for aircraft and missile platforms due to their inherent low weight and drag properties. However, to date there has been a dearth of rigorous analytical or numerical solutions to aid the designer. In fact, it has been common practice to use limited measurements and planar approximations in designing such non-planar antennas. The finite element-boundary integral method is extended to scattering and radiation by cavity-backed structures in an infinite, metallic cylinder. In particular, the formulation specifics such as weight functions, dyadic Green's function, implementation details, and particular difficulties inherent to cylindrical structures are discussed. Special care is taken to ensure that the resulting computer program has low memory demand and minimal computational requirements. Both scattering and radiation parameters are computed and validated as much as possible.

Kempel, Leo C.↗

NASA NTRS1994

Scattering by cavity-backed antennas on a circular cylinder

Conformal arrays are popular antennas for aircraft, spacecraft, and land vehicle platforms due to their inherent low weight and drag properties. However, to date there has been a dearth of rigorous analytical or numerical solutions to aid the designer. In fact, it has been common practice to use limited measurements and planar approximations in designing such non-planar antennas. The finite element-boundary integral method is extended to scattering by cavity-backed structures in an infinite, metallic cylinder. In particular, the formulation specifics such as weight functions, dyadic Green's function, implementation details and particular difficulties inherent to cylindrical structures are discussed. Special care is taken to ensure that the resulting computer program has low memory demand and minimal computational requirements. Scattering results are presented and validated as much as possible.

Kempel, Leo C.↗