ON PARALLELIZATION OF ASSEMBLY OPERATIONS IN FINITE ELEMENT SOFTWARE
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F16%3A00242993" target="_blank" >RIV/68407700:21110/16:00242993 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
ON PARALLELIZATION OF ASSEMBLY OPERATIONS IN FINITE ELEMENT SOFTWARE
Popis výsledku v původním jazyce
Current development in computer hardware brings in new opportunities in numerical modelling. Computers with a single processing unit, where only one instruction can be processed at any moment in time, allow us to run simulation codes only sequentially. The performance of single processing units is reaching the physical limits, given by transmission delays and heat build-up on the silicon hips. The future of scientific computing seems to be in parallel computing, that allows to overcome the limitations of traditional sequential processing units. Parallel computing is based on simultaneous use of multiple processing units. The fundamental paradigm in parallel computing is based on work decomposition into pieces of work that can be processed simultaneously. This contribution focuses on parallelization of sparse matrix and global vector assembly operations, which are typical to any finite element code. The aim of presented work is to propose an alternative approach to assembly operation based on decomposition of the work into independent element groups, members of which can be processed concurrently without blocking operation. The individual groups contain elements contributing to distinct entries in sparse matrix or global vector. Such decomposition is done using colouring algorithm. As the elements in group contribute to distinct locations, there is no need to prevent the race condition, that can occur when the same location is updated simultaneously. It is only necessary to enforce synchronization before processing each element group. Efficiency of implemented approach is compared to approach based on decomposition of assembly loop using OpenMP and POSIX threads directives and explicit locking of updated locations in sparse matrix or global vector, which was published by the authors in (Bosansky & Patzak, 2016a) and (Bosansky & Patzak, 2016b).
Název v anglickém jazyce
ON PARALLELIZATION OF ASSEMBLY OPERATIONS IN FINITE ELEMENT SOFTWARE
Popis výsledku anglicky
Current development in computer hardware brings in new opportunities in numerical modelling. Computers with a single processing unit, where only one instruction can be processed at any moment in time, allow us to run simulation codes only sequentially. The performance of single processing units is reaching the physical limits, given by transmission delays and heat build-up on the silicon hips. The future of scientific computing seems to be in parallel computing, that allows to overcome the limitations of traditional sequential processing units. Parallel computing is based on simultaneous use of multiple processing units. The fundamental paradigm in parallel computing is based on work decomposition into pieces of work that can be processed simultaneously. This contribution focuses on parallelization of sparse matrix and global vector assembly operations, which are typical to any finite element code. The aim of presented work is to propose an alternative approach to assembly operation based on decomposition of the work into independent element groups, members of which can be processed concurrently without blocking operation. The individual groups contain elements contributing to distinct entries in sparse matrix or global vector. Such decomposition is done using colouring algorithm. As the elements in group contribute to distinct locations, there is no need to prevent the race condition, that can occur when the same location is updated simultaneously. It is only necessary to enforce synchronization before processing each element group. Efficiency of implemented approach is compared to approach based on decomposition of assembly loop using OpenMP and POSIX threads directives and explicit locking of updated locations in sparse matrix or global vector, which was published by the authors in (Bosansky & Patzak, 2016a) and (Bosansky & Patzak, 2016b).
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
JM - Inženýrské stavitelství
OECD FORD obor
—
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2016
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Engineering Mechanics 2016 - Book of full texts
ISBN
978-80-87012-59-8
ISSN
1805-8248
e-ISSN
—
Počet stran výsledku
4
Strana od-do
82-85
Název nakladatele
Institute of Thermomechanics, AS CR, v.v.i.
Místo vydání
Prague
Místo konání akce
Svratka
Datum konání akce
9. 5. 2016
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
000379986700017