Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03100059" target="_blank" >RIV/68407700:21230/04:03100059 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Original language description
We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decomposition of a problem is performed using a graph partitioning. It results in sparse submatrices with balanced sizes. An envelope method is used to factorize these submatrices. However, the memory requirements to store them and the computational cost to factorize them depends heavily on their structure. We propose a technique that modifies themultilevel graph partitioning schema to balance real computational load or memory requirements of the solver.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
D - Article in proceedings
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IBS3086102" target="_blank" >IBS3086102: Parallel Algorithms for Large Scale Simulation on PC Clusters</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Euro-Par 2004 Parallel Processing
ISBN
3-540-22924-8
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
734-741
Publisher name
Springer
Place of publication
Berlin
Event location
Pisa
Event date
Aug 31, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—