Zobrazeno 1 - 10
of 380
pro vyhledávání: '"Christian Lengauer"'
Autor:
Christian Lengauer
Publikováno v:
Edsger Wybe Dijkstra ISBN: 9781450397735
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1736e5e6352d80d9e3b6983ee49e027e
https://doi.org/10.1145/3544585.3544596
https://doi.org/10.1145/3544585.3544596
Autor:
Jürgen Teich, Christian Schmitt, Christian Lengauer, Sven Apel, Stefan Groth, Lisa Claus, Stefan Kronawitter, Alexander Grebhahn, Harald Köstler, Sebastian Kuckuk, Shigeru Chiba, Ulrich Rüde, Armin Größlinger, Jonas Schmitt, Matthias Bolten, Hannah Rittich, Frank Hannig
Publikováno v:
Software for Exascale Computing-SPPEXA 2016-2019 ISBN: 9783030479558
Software for Exascale Computing
Software for Exascale Computing
Present-day stencil codes are implemented in general-purpose programming languages, such as Fortran, C, or Java, Python or derivates thereof, and harnesses for parallelism, such as OpenMP, OpenCL or MPI. Project ExaStencils pursued a domain-specific
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a980a5061e13653e7219beb925800ae3
https://doi.org/10.1007/978-3-030-47956-5_14
https://doi.org/10.1007/978-3-030-47956-5_14
Autor:
Ronald Miletich, Georg Gravogl, Felix Birkelbach, Danny Müller, Christian Lengauer, Peter Weinberger
Publikováno v:
Goldschmidt Abstracts.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe8d5e677f1795430a5689b39ca1d219
https://doi.org/10.46427/gold2020.1801
https://doi.org/10.46427/gold2020.1801
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 15:1-27
Iterative program optimization is known to be able to adapt more easily to particular programs and target hardware than model-based approaches. An approach is to generate random program transformations and evaluate their profitability by applying the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5fcc2f2970f1963c431525b6b52f09e
https://doi.org/10.1145/3291773
https://doi.org/10.1145/3291773
Publikováno v:
Proceedings of the IEEE. 106:1969-1984
The purpose of a domain-specific language (DSL) is to enable the application programmer to specify a problem, or an abstract algorithm description, in his/her domain of expertise without being burdened by implementation details. The ideal scenario is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c80c5a22be20f7ecea53c1326c9caf51
https://doi.org/10.1109/jproc.2018.2854229
https://doi.org/10.1109/jproc.2018.2854229
Publikováno v:
Journal of Geosciences. :215-226
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7c3edd2ba4206a49f7be369cc942c8d
https://doi.org/10.3190/jgeosci.266
https://doi.org/10.3190/jgeosci.266
Publikováno v:
International Journal of Parallel Programming. 47:874-906
While polyhedral optimization appeared in mainstream compilers during the past decade, its profitability in scenarios outside its classic domain of linear-algebra programs has remained in question. Recent implementations, such as the LLVM plugin Poll
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ac999e9d633247a0f646f0334121b8e
https://doi.org/10.1007/s10766-018-0597-3
https://doi.org/10.1007/s10766-018-0597-3
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 14:1-26
The polyhedron model is a powerful model to identify and apply systematically loop transformations that improve data locality (e.g., via tiling) and enable parallelization. In the polyhedron model, a loop transformation is, essentially, represented a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8f59ce1878f3a914b8e1b8156ee67b7
https://doi.org/10.1145/3109482
https://doi.org/10.1145/3109482
Publikováno v:
Parallel Processing Letters. 28
Performance optimizations should focus not only on the computations of an application, but also on the internal data layout. A well-known problem is whether a struct of arrays or an array of structs results in a higher performance for a particular ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efb8e21c1286b6ef66d1f4ba435b68f2
https://doi.org/10.1142/s0129626418500093
https://doi.org/10.1142/s0129626418500093
Publikováno v:
Concurrency and Computation: Practice and Experience. 29
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80c2dd298303eb96c9f0a6d1bc2a1bf2
https://doi.org/10.1002/cpe.4142
https://doi.org/10.1002/cpe.4142