
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Abhiram Ranade, Valerie E. Taylor, David G. Messerschmitt, "SPAR: A New Architecture for Large Finite Element Computations," IEEE Transactions on Computers, vol. 44, no. 4, pp. 531545, April, 1995.  
BibTex  x  
@article{ 10.1109/12.376168, author = {Abhiram Ranade and Valerie E. Taylor and David G. Messerschmitt}, title = {SPAR: A New Architecture for Large Finite Element Computations}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {4}, issn = {00189340}, year = {1995}, pages = {531545}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.376168}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  SPAR: A New Architecture for Large Finite Element Computations IS  4 SN  00189340 SP531 EP545 EPD  531545 A1  Abhiram Ranade, A1  Valerie E. Taylor, A1  David G. Messerschmitt, PY  1995 KW  Computer architecture KW  compact data structures KW  finite element method KW  resource utilization KW  sparse matrices. VL  44 JA  IEEE Transactions on Computers ER   
[1] A. Austin,“The PAFEC finite element analysis system,” Finite Element Systems: A Handbook, C.A. Brebbia, ed., SpringerVerlag, New York, 1985.
[2] C. Aykanat,F. Ozguner,S. Martin,, and S.M. Doraivelu,“Parallelization of a finite element application program on a hypercube multiprocessor,” Proc. Second Conf. Hypercube Multiprocessors, SIAM, 1987, pp. 662673.
[3] K. Bathe,Finite Element Procedure in Engineering Analysis, Prentice Hall, New Jersey, 1982.
[4] R. Chandra,“Conjugate gradient methods for partial differential equations,” Ph.D. Dissertation, Dept. Computer Science, Yale Univ., New Haven, Conn., 1978.
[5] Cray YMP Computer Systems Reference Manual, SQ0083 C, Cray Research Inc., 1985.
[6] Directory of Applications Software for Cray Supercomputers, Cray Research Inc., Jan. 1989.
[7] I.S. Duff,A.M. Erisman,, and J.K. Reid,Direct Methods for Sparse Matrices, Clarendon Press, Oxford, 1986.
[8] C. Farhat,E. Wilson,, and G. Powell,“Solution of finite element systems on concurrent processing computers,” Engineering with Computers, vol. 2, 1987, pp. 157165.
[9] C. Farhat, and M. Lesoinne,“Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics,” Int’l J. Numerical Methods in Eng., vol. 36, 1993, pp. 745764.
[10] R.M. Ferencz,“Elementbyelement preconditioning techniques for largescale, vectorized finite element analysis in nonlinear solid and structural mechanics,” Ph.D. Dissertation, Dept. Mechanical Engineering, Stanford Univ., Palo Alto, Calif., 1989.
[11] A. George,“Nested dissection of a regular finiteelement mesh,” SIAM J. Numerical Analysis, vol. 10, 1973, pp. 345363.
[12] A. George,“Numerical experiments using dissection method to solve n by ngrid problems,” SIAM J. Numerical Analysis, vol. 14, Apr. 1977, pp. 161179.
[13] A. George and J. W.H. Liu,Computer Solution of Large Sparse Positive Difinite Systems. Englewood Cliffs, NJ: PrenticeHall, 1981.
[14] D. Goehlich,R.E. Fulton,, and L. Komzsik,“Program designs and data structures for vectorized finite element computations,” Proc. Fourth Int’l Conf. Supercomputing, 1989, pp. 434438.
[15] G.H. Golub and C.F. Van Loan,Matrix Calculations, The Johns Hopkins Univ. Press, Baltimore, 1983.
[16] L.J. Hayes and P. Devloo,“A vectorized version of a sparse matrixvector multiply,” Int’l J. Numerical Methods in Eng., vol. 23, 1986, pp. 10431056.
[17] C.H. Hamilton and R.S. Gallagher,“PATRAN  The computational laboratory,” Finite Element Systems: A Handbook, C.A. Brebbia, ed., SpringerVerlag, New York, 1985.
[18] S.W. Hammond and K. Law,“Architecture and operation of a systolic engine for finite element computations,” J. Computers and Structures, vol. 30, no. 1/2, Oct. 1988, pp. 365374.
[19] A.J. Hoffman,M.S. Martin,, and D.J. Rose,“Complexity bounds for regular finite difference and finite element grids,” SIAM J. Numerical Analysis, vol. 10, 1973, pp. 364369.
[20] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, Calif., 1990.
[21] M. Heroux, Personal communications, numerical analyst, MathematicalSoftware Group, Cray Research, Eagan, Minn.
[22] M.R. Hestenes and E. Stiefel,“Method of conjugate gradients for solving linear systems,” J. Research of the Nat’l Bureau of Standards, vol. 49, 1952, pp. 409436.
[23] R.G. Hintz and D.P. Tate,“Control Data STAR100 processor design,” COMPCON, Sept. 1972, pp. 14.
[24] T.J. Hughes,The Finite Element Method: Linear Static and Dynamic Finite Element Analysis, Prentice Hall, New Jersey, 1987.
[25] H.F. Jordan,“A special purpose architecture for finite element analysis,” Proc. 1978 Int’l Conf. Parallel Processing, Aug. 1978, pp. 263266.
[26] H.F. Jordan and P.L. Sawyer,“A multiprocessor system for finite element structural analysis,” Computers and Structures, vol. 10, 1979, pp. 2129.
[27] D.R. Kincaid,J.R. Respess,D.M. Young,, and R.G. Grimes,“ITPACK 2C: A FORTRAN package for solving large sparse linear systems by adaptive accelerated iterative methods,” ACM Trans. Mathematical Software, vol. 8, 1982, pp. 302322.
[28] P.M. Kogge,The Architecture of Pipelined Computers, McGrawHill, New York, N.Y., 1981.
[29] K.H. Law,“Systolic schemas for finite element methods,” R82139, Carnegie Mellon Univ., July 1982.
[30] D.D. Loendorf,“Development and use of an asynchronous MIMD computer for finite element analysis,” Algorithmically Specialized Parallel Computers, Academic Press, 1985.
[31] N. Lincoln,“Technology and design tradeoffs in the creation of modern supercomputers,” IEEE Trans. Computers, vol. 31, 1982, pp. 349362.
[32] J.W. Liu,“The minimum degree ordering with constraints,” SIAM J. Sci. Stat. Comp., vol. 10, Nov. 1989, pp. 11361145.
[33] Lockheed Palo Alto Research Laboratories, Computational Mechanics Section.
[34] N.K. Madsen,G.H. Rodrigue,, and J.I. Karush,“Matrix multiplication by diagonals on a vector/parallel processor,” Information Processing Letters, vol. 5, no. 2, 1976, pp. 4145.
[35] J.G. Malone,“High performance using a hypercube architecture for parallel nonlinear dynamic finite element analysis,” Proc. Fourth Int’l Conf. Supercomputing, 1989, pp. 434438.
[36] R. Melhem,“On the design of a pipelined/systolic finite element system,” Computers&Structures, vol. 20, no. 13, 1985, pp. 6775.
[37] R.G. Melhem,“Determination of stripe structures for finite element matrices,” SIAM J. Numerical Analysis, vol. 24, no. 6, Dec. 1987, pp. 14191433.
[38] R.G. Melhem,“Solution of linear systems with striped sparse matrices,” Parallel Computing, vol. 6, no. 2, Feb. 1988, pp. 165184.
[39] R. Melhem,“A systolic accelerator for the iterative solution of sparse linear system,” IEEE Trans. Computers, vol. 38, no. 11, Nov. 1989, pp. 15911595.
[40] B. NourOmid,A. Raefsky,, and G. Lyzenga,“Solving finite element equations on concurrent computers,” Parallel Computations and Their Impact on Mechanics, A.K. Noor, ed., Am. Soc. Mechanical Engineers, New York, 1987.
[41] B. NourOmid and K.C. Park,“Solving structural mechanics problems on the Caltech hypercube machine,” Computer Methods in Applied Mechanics and Eng., vol. 61, 1987, pp. 161176.
[42] J.M. Ortega, Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York, 1988.
[43] G.V. Paolini,G. Radicati,, and D. Brozolo,“Data structures for vectorizing the conjugate gradient algorithm for general sparsity patterns,” BIT, vol. 29, 1989, pp. 703718.
[44] J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, San Mateo, Calif., 1990.
[45] J.N. Reddy,An Introduction to the Finite Element Method, McGraw Hill, New York, 1984.
[46] D. Siewiorek, G. Bell, and A. Newell, Computer Structures: Principles and Examples.New York: McGrawHill, 1981.
[47] H.D. Simon,“Partitioning of unstructured problems for parallel processing,” Computing Systems in Eng., vol. 2, 1991, pp. 135148.
[48] O. Storaasli,J. Ransom,, and R. Fulton,“Structural dynamic analysis on a parallel computer: The finite element machine,” Computers and Structures, vol. 26, no. 4, 1987, pp. 551559.
[49] G. Strang and G.J. Fix,An Analysis of the Finite Element Method, Prentice Hall, New Jersey, 1973.
[50] V.E. Taylor,“Applicationspecific architectures for large finiteelement applications,” Ph.D. Dissertation, Dept. Electrical Engineering and ComputerSciences, Univ. of California at Berkeley, Berkeley, Calif., 1991.
[51] V.E. Taylor,B. NourOmid,, and D.G. Messerschmitt,“The effects of communication overhead on the speedup of parallel 3D finite element applications,” Sixth Int’l Parallel Processing Symp., 1992, pp. 531536.
[52] V.E. Taylor, “Sparse Matrix Computations: Implications for Cache Designs,” Proc. Supercomputing '92, pp. 598607, 1992.
[53] A. Wolfe,M. Breternitz Jr.,C. Stephens,A.L. Ting,D.B. Kirk,R.P. Bianchini Jr.,, and J.P. Shen,“The White Dwarf: A highperformance applicationspecific processor,” IEEE Int’l Conf. Computer Architecture, 1988, pp. 212222.