Zobrazit minimální záznam

dc.contributor.authorMerta, Michal
dc.contributor.authorZapletal, Jan
dc.date.accessioned2015-07-20T07:10:26Z
dc.date.available2015-07-20T07:10:26Z
dc.date.issued2015
dc.identifier.citationAdvances in engineering software. 2015, vol. 86, p. 70-79.cs
dc.identifier.issn0965-9978
dc.identifier.issn1873-5339
dc.identifier.urihttp://hdl.handle.net/10084/106819
dc.description.abstractAlthough parallelization of computationally intensive algorithms has become a standard with the scientific community, the possibility of in-core vectorization is often overlooked. With the development of modern HPC architectures, however, neglecting such programming techniques may lead to inefficient code hardly utilizing the theoretical performance of nowadays CPUs. The presented paper reports on explicit vectorization for quadratures stemming from the Galerkin formulation of boundary integral equations in 3D. To deal with the singular integral kernels, two common approaches including the semi-analytic and fully numerical schemes are used. We exploit modern SIMD (Single Instruction Multiple Data) instruction sets to speed up the assembly of system matrices based on both of these regularization techniques. The efficiency of the code is further increased by standard shared-memory parallelization techniques and is demonstrated on a set of numerical experiments.cs
dc.language.isoencs
dc.publisherElseviercs
dc.relation.ispartofseriesAdvances in Engineering Softwarecs
dc.relation.urihttp://dx.doi.org/10.1016/j.advengsoft.2015.04.008cs
dc.rightsCopyright © 2015 Elsevier Ltd. All rights reserved.cs
dc.titleAcceleration of boundary element method by explicit vectorizationcs
dc.typearticlecs
dc.identifier.doi10.1016/j.advengsoft.2015.04.008
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume86cs
dc.description.lastpage79cs
dc.description.firstpage70cs
dc.identifier.wos000356191100008


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam