The Finite Element Machine (FEM) was a late 1970s-early 1980s NASA project to build and evaluate the performance of a parallel computer for structural analysis. The FEM was completed and successfully tested at the NASA Langley Research Center in Hampton, Virginia.[1] The motivation for FEM arose from the merger of two concepts: the finite element method of structural analysis and the introduction of relatively low-cost microprocessors.
In the finite element method, the behavior (stresses, strains and displacements resulting from load conditions) of large-scale structures is approximated by a FE model consisting of structural elements (members) connected at structural node points. Calculations on traditional computers are performed at each node point and results communicated to adjacent node points until the behavior of the entire structure is computed. On the Finite Element Machine, microprocessors located at each node point perform these nodal computations in parallel. If there are more node points (N) than microprocessors (P), then each microprocessor performs N/P computations. The Finite Element Machine contained 32 processor boards each with a Texas Instruments TMS9900 processor, 32 Input/Output (IO) boards and a TMS99/4 controller. The FEM was conceived, designed and fabricated at NASA Langley Research Center. The TI 9900 processor chip was selected by the NASA team as it was the first 16-bit processor available on the market which until then was limited to less powerful 8-bit processors. The FEM concept was first successfully tested to solve beam bending equations on a Langley FEM prototype (4 IMSAI 8080s). This led to full-scale FEM fabrication & testing by the FEM hardware-software-applications team led by Dr. Olaf Storaasli formerly of NASA Langley Research Center and Oak Ridge National Laboratory (currently at USEC).
The first significant Finite Element Machine results are documented in: The Finite Element Machine: An experiment in parallel processing (NASA TM 84514).[1]
Based on the Finite Element Machine's success in demonstrating Parallel Computing viability, (alongside ILLIAC IV and Goodyear MPP), commercial parallel computers soon were sold. NASA Langley subsequently purchased a Flex/32 Multicomputer (and later Intel iPSC and Intel Paragon) to continue parallel finite element algorithm R&D. In 1989, the parallel equation solver code, first prototyped on FEM, and tested on FLEX was ported to NASA's first Cray YMP via Force[2] (Fortran for Concurrent Execution) to reduce the structural analysis computation time for the space shuttle Challenger Solid Rocket Booster resdesign with 54,870 equations from 14 hours to 6 seconds. This research accomplishment was awarded the first Cray GigaFLOP Performance Award at Supercomputing '89. This code evolved into NASA's General-Purpose Solver (GPS) for Matrix Equations used in numerous finite element codes to speed solution time. GPS sped up AlphaStar Corporation's Genoa code 10X, allowing 10X larger applications for which the team received NASA's 1999 Software of the Year Award and a 2000 R&D100 Award.
^ abCite error: The named reference FEM machine was invoked but never defined (see the help page).
^Cite error: The named reference Force was invoked but never defined (see the help page).
and 24 Related for: Finite element machine information
The FiniteElementMachine (FEM) was a late 1970s-early 1980s NASA project to build and evaluate the performance of a parallel computer for structural...
The finiteelement method (FEM) is a popular method for numerically solving differential equations arising in engineering and mathematical modeling. Typical...
The finiteelement method (FEM) is a powerful technique originally developed for numerical solution of complex problems in structural mechanics, and it...
Finiteelement exterior calculus (FEEC) is a mathematical framework that formulates finiteelement methods using chain complexes. Its main application...
Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose...
In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs...
investigate molecular surface structures Finiteelementmachine, a parallel computer project by NASA Finiteelement method, a numerical technique for partial...
In numerical analysis, the interval finiteelement method (interval FEM) is a finiteelement method that uses interval parameters. Interval FEM can be...
mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle...
algorithm. The machine operates on an infinite memory tape divided into discrete cells, each of which can hold a single symbol drawn from a finite set of symbols...
successfully develop one of NASA's first parallel computers, the finiteelementmachine, & developed rapid matrix equation algorithms tailored for high-performance...
NASTRAN is a finiteelement analysis (FEA) program that was originally developed for NASA in the late 1960s under United States government funding for...
2015-01-19 at the Wayback Machine Nonlinear FiniteElement Analysis of Elastomers Archived 2015-01-19 at the Wayback Machine When f≠Ku, An introductory...
Canonical Richard Stallman, founder of GNU Olaf Storaasli, NASA Finiteelementmachine Bjarne Stroustrup, founder of C++ Ken Thompson, Unix and Plan 9...
Femap (FiniteElement Modeling And Postprocessing) is an engineering analysis program sold by Siemens Digital Industries Software that is used to build...
generates T. A single element x of S generates the subsemigroup { xn | n ∈ Z+ }. If this is finite, then x is said to be of finite order, otherwise it is...
finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine,...
finite, or if a canonical rule on how to choose the elements is available — some distinguishing property that happens to hold for exactly one element...
the field with one element is a suggestive name for an object that should behave similarly to a finite field with a single element, if such a field could...
Transition monoids and syntactic monoids are used in describing finite-state machines. Trace monoids and history monoids provide a foundation for process...
can be finite, as in these examples, or infinite, such as the sequence of all even positive integers (2, 4, 6, ...). The position of an element in a sequence...
Global Information