About: Static Load Balancing Applied to Schur Complement Method     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • We consider parallel solvers based on the Schur complement method on homogeneous parallel machines with distributed memory. A finite element mesh is partitioned by graph partitioning. Such partitioning results in submeshes with similar numbers of elements and, consequently, submatrices of similar sizes. The submatrices are partially factorised. The time spent on the partial factorisation can be different, i.e., disbalanced, because methods exploiting the sparsity of submatrices are used. This paper proposes a Quality Balancing heuristic that modifies classic mesh partitioning so that the partial factorisation times are balanced, which saves overall computation time, especially for time dependent mechanical and nonstationary transport problems.
  • We consider parallel solvers based on the Schur complement method on homogeneous parallel machines with distributed memory. A finite element mesh is partitioned by graph partitioning. Such partitioning results in submeshes with similar numbers of elements and, consequently, submatrices of similar sizes. The submatrices are partially factorised. The time spent on the partial factorisation can be different, i.e., disbalanced, because methods exploiting the sparsity of submatrices are used. This paper proposes a Quality Balancing heuristic that modifies classic mesh partitioning so that the partial factorisation times are balanced, which saves overall computation time, especially for time dependent mechanical and nonstationary transport problems. (en)
  • We consider parallel solvers based on the Schur complement method on homogeneous parallel machines with distributed memory. A finite element mesh is partitioned by graph partitioning. Such partitioning results in submeshes with similar numbers of elements and, consequently, submatrices of similar sizes. The submatrices are partially factorised. The time spent on the partial factorisation can be different, i.e., disbalanced, because methods exploiting the sparsity of submatrices are used. This paper proposes a Quality Balancing heuristic that modifies classic mesh partitioning so that the partial factorisation times are balanced, which saves overall computation time, especially for time dependent mechanical and nonstationary transport problems. (cs)
Title
  • Static Load Balancing Applied to Schur Complement Method
  • Statické vyvažovaní zátěže pro metodu Schurových doplňků (cs)
  • Static Load Balancing Applied to Schur Complement Method (en)
skos:prefLabel
  • Static Load Balancing Applied to Schur Complement Method
  • Statické vyvažovaní zátěže pro metodu Schurových doplňků (cs)
  • Static Load Balancing Applied to Schur Complement Method (en)
skos:notation
  • RIV/68407700:21230/07:03131038!RIV08-MSM-21230___
http://linked.open.../vavai/riv/strany
  • 489;498
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770014)
http://linked.open...iv/cisloPeriodika
  • 9
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 452310
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:03131038
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Domain decomposition; Finite element methods; Mesh partitioning; Multilevel graph partitioning (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV
  • [E2727F966F5D]
http://linked.open...i/riv/nazevZdroje
  • Computers and Structures
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 85
http://linked.open...iv/tvurceVysledku
  • Bittnar, Zdeněk
  • Kruis, Jaroslav
  • Tvrdík, Pavel
  • Medek, Ondřej
http://linked.open...n/vavai/riv/zamer
issn
  • 0045-7949
number of pages
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.116 as of Feb 22 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3239 as of Feb 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 81 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software