This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F05%3A03107453%21RIV06-MSM-21230___/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n5http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n22http://linked.opendata.cz/ontology/domain/vavai/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
n7https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F05%3A03107453%21RIV06-MSM-21230___
rdf:type
n22:Vysledek skos:Concept
dcterms:description
Používáme paralelní přímý řešič na bázi Schurových doplňků pro řešení velkých řídkých lineárních systémů, vzniklých z metody konečných prvků. Doménová dekompozice se provádí pomocí dělení grafu a vede na řídké podmatice. Tyto podmatice se ukladájí v paměti a faktorizují se obálkovou metodou. Ale napřed se proměnné v každé podmatici přečíslují Sloanovým algoritmem, aby se minimalizovaly kvality: paměťové nároky a čas faktorizace. Tyto kvality jsou obyčejně nevyvážené. V tomto příspěvku popisujeme výsledky integrace Quality Balancing (QB) heuristiky, která vyvažuje kvality, a modifikace Sloanova algoritmu, nazývanou Boundary Sloan algoritmus (BSA). Diskutujeme problémy v chování QB heuristiky a vyhodnocujeme implementaci 3 variant Sloanova algoritmu s QB heuristikou. 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. An envelope method is used to store these submatrices in the memory and to factorize them. Prior to the solution, the variables of each submatrix are reordered by the Sloan algorithm to minimize qualities: memory requirements and the factorization time. These qualities are usually disbalanced. In this paper, we describe results of integrating our recently developed Quality Balancing (QB) heuristics and our modification of the Sloan algorithm, called Boundary Sloan algorithm (BSA), to balance the qualities. We discuss the issues of behaviour of the QB heuristics and evaluate the results of implementation of 3 variants of the Sloan algorithm within the QB heuristics. 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. An envelope method is used to store these submatrices in the memory and to factorize them. Prior to the solution, the variables of each submatrix are reordered by the Sloan algorithm to minimize qualities: memory requirements and the factorization time. These qualities are usually disbalanced. In this paper, we describe results of integrating our recently developed Quality Balancing (QB) heuristics and our modification of the Sloan algorithm, called Boundary Sloan algorithm (BSA), to balance the qualities. We discuss the issues of behaviour of the QB heuristics and evaluate the results of implementation of 3 variants of the Sloan algorithm within the QB heuristics.
dcterms:title
Heuristika pro vyvažování kvalit se třemi variantami hraničního Sloanova algoritmu Quality Balancing Heuristics with Three Variants of Sloan Algorithm Quality Balancing Heuristics with Three Variants of Sloan Algorithm
skos:prefLabel
Heuristika pro vyvažování kvalit se třemi variantami hraničního Sloanova algoritmu Quality Balancing Heuristics with Three Variants of Sloan Algorithm Quality Balancing Heuristics with Three Variants of Sloan Algorithm
skos:notation
RIV/68407700:21230/05:03107453!RIV06-MSM-21230___
n3:strany
644 ; 650
n3:aktivita
n19:P n19:Z
n3:aktivity
P(IBS3086102), Z(MSM6840770014)
n3:dodaniDat
n18:2006
n3:domaciTvurceVysledku
n21:1515977 n21:9540814
n3:druhVysledku
n13:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
539790
n3:idVysledku
RIV/68407700:21230/05:03107453
n3:jazykVysledku
n14:eng
n3:klicovaSlova
Sloan algorithm; domain docomposition; load balancing; parallel solver
n3:klicoveSlovo
n8:Sloan%20algorithm n8:parallel%20solver n8:load%20balancing n8:domain%20docomposition
n3:kontrolniKodProRIV
[20706E428C68]
n3:mistoKonaniAkce
Innsbruck
n3:mistoVydani
Anaheim
n3:nazevZdroje
Proceedings of the IASTED International Conference on PARALLEL AND DISTRIBUTED COMPUTING AND NETWORKS PDCN 2005
n3:obor
n4:JD
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n9:IBS3086102
n3:rokUplatneniVysledku
n18:2005
n3:tvurceVysledku
Tvrdík, Pavel Medek, Ondřej
n3:typAkce
n16:WRD
n3:zahajeniAkce
2005-02-15+01:00
n3:zamer
n11:MSM6840770014
s:numberOfPages
7
n5:hasPublisher
ACTA Press
n7:isbn
0-88986-468-3
n17:organizacniJednotka
21230