High Performance Computing in Science and Engineering, Garching 2004
DOI: 10.1007/3-540-28555-5_7
|View full text |Cite
|
Sign up to set email alerts
|

SkvG: Cache-Optimal Parallel Solution of PDEs on High Performance Computers Using Space-Trees and Space-Filling Curves

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…The parallelisation of Peano follows a domain decomposition approach based on the ordering of grid cells along the corresponding discrete iterate of the Peano curve. Simply spoken, the queue of grid cells resulting from the ordering along the respective iterate of the Peano curve is cut into equal pieces to achieve a balanced partitioning [24,29]. Parallelisation concepts based on space-filling curves have become more and more popular in the recent years and have successfully been implemented by different groups (see for example [11,23,26,46,56] and citations therein).…”
Section: Introductionmentioning
confidence: 99%
“…The parallelisation of Peano follows a domain decomposition approach based on the ordering of grid cells along the corresponding discrete iterate of the Peano curve. Simply spoken, the queue of grid cells resulting from the ordering along the respective iterate of the Peano curve is cut into equal pieces to achieve a balanced partitioning [24,29]. Parallelisation concepts based on space-filling curves have become more and more popular in the recent years and have successfully been implemented by different groups (see for example [11,23,26,46,56] and citations therein).…”
Section: Introductionmentioning
confidence: 99%