ACM/IEEE SC 2002 Conference (SC'02) 2002
DOI: 10.1109/sc.2002.10028
|View full text |Cite
|
Sign up to set email alerts
|

Salinas: A Scalable Software for High-Performance Structural and Solid Mechanics Simulations

Abstract: We present Salinas, a scalable implicit software application for the finite element static and dynamic analysis of complex structural real-world systems. This relatively complete engineering software with more than 100,000 lines of ¤ ¥ ¥ code and a long list of users sustains 292.5 Gflop/s on 2,940 ASCI Red processors, and 1.16 Tflop/s on 3,375 ASCI White processors.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0
2

Year Published

2005
2005
2015
2015

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 58 publications
(50 citation statements)
references
References 30 publications
0
48
0
2
Order By: Relevance
“…This in turn suggests that a FETI method that is wellimplemented on a parallel processor should be capable of solving an n-times larger problem using an n-times larger number of processors in almost a constant amount of CPU time. Indeed, these numerical and parallel scalability properties have been demonstrated in practice for many complex structural mechanics and structural dynamics problems (for example, see [15,16] and the references cited therein).…”
Section: The Feti-dp Methodsmentioning
confidence: 99%
“…This in turn suggests that a FETI method that is wellimplemented on a parallel processor should be capable of solving an n-times larger problem using an n-times larger number of processors in almost a constant amount of CPU time. Indeed, these numerical and parallel scalability properties have been demonstrated in practice for many complex structural mechanics and structural dynamics problems (for example, see [15,16] and the references cited therein).…”
Section: The Feti-dp Methodsmentioning
confidence: 99%
“…We implemented two approaches discussed in [4]. In the case of relatively small C studied here one can invert C in parallel by duplicating it across a group of processors so that each computes a column of C −1 by a direct solver, for which we employed SPOOLES.…”
Section: Parallel Implementation and Resultsmentioning
confidence: 99%
“…Let S (l) denote the Schur complement of K (l) , see (4), with respect to unknowns at the nodal points of ∂Ω l . This matrix is represented as…”
Section: Feti-dp Equation and Preconditionermentioning
confidence: 99%
See 2 more Smart Citations