1994
DOI: 10.1142/2190
|View full text |Cite
|
Sign up to set email alerts
|

Solving Partial Differential Equations on Parallel Computers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

1997
1997
2011
2011

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 23 publications
(25 citation statements)
references
References 0 publications
0
25
0
Order By: Relevance
“…However, these peak execution rates are very difficut to achieve or sustain in realistic codes. It is not unusual, in practice, to have a sustained rate which is only 10-20% of the peak performance [2]. Next, the Delta uses a distributed MIMD architecture: communication is required when more than one node is used to perform a given task.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, these peak execution rates are very difficut to achieve or sustain in realistic codes. It is not unusual, in practice, to have a sustained rate which is only 10-20% of the peak performance [2]. Next, the Delta uses a distributed MIMD architecture: communication is required when more than one node is used to perform a given task.…”
Section: Resultsmentioning
confidence: 99%
“…Using the data f, Q and g defined by (2) and (3) As mentioned earlier, since the discretization is static and regular, the nodes can be load balanced at the start of the code by ensuring that each subdomain contains the same number of grid points. The algorithm simply consists of steps that concurrently update the processor subregions, separated by communication steps that involve the swapping of edge values between neighboring processors.…”
Section: Parallel Implementation and Complexity Estimatesmentioning
confidence: 99%
“…in the subdomain I , we have a system of algebraic equations of the form B I x I = c I ; I = 1; 2; : : : ; M (27) where the superscript I denotes the subdomain I , M is the number of subdomains, and…”
Section: Domain Decomposition Methodsmentioning
confidence: 99%
“…Each of the M local matrix systems given by Equation (27) can be assembled with its neighbouring systems according to the matching conditions given by Equations (31)-(34).…”
Section: Domain Decomposition Methodsmentioning
confidence: 99%
See 1 more Smart Citation