Christian Schmitt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Christian Schmitt has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Frank Hannig
Department of Computer Science, Friedrich-Alexander-Universitt Erlangen-Nrnberg, Erlangen, Germany
9 shared publications Harald Köstler
5 shared publicationsSebastian Kuckuk
5 shared publicationsJürgen Teich
4 shared publicationsChristian Lengauer
3 shared publicationsUlrich Rüde
3 shared publications
Latest Publications
- 14 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 106 (11) , 1969-1984
Automating the Development of High-Performance Multigrid Solvers
- 14 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 106 (11) , 1969-1984
Automating the Development of High-Performance Multigrid Solvers
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 189-196
OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes
The exploration of FPGAs as accelerators for scientific simulations has so far mostly been focused on small kernels of methods working on regular data structures, for example in the form of stencil computations for finite difference methods. In computational sciences, often more advanced methods are employed that promise better stability, convergence, locality and scaling. Unstructured meshes are shown to be more effective and more accurate, compared to regular grids, in representing computation domains of various shapes. Using unstructured meshes, the discontinuous Galerkin method preserves the ability to perform explicit local update operations for simulations in the time domain. In this work, we investigate FPGAs as target platform for an implementation of the nodal discontinuous Galerkin method to find time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing data reuse and fitting constant coefficients into suitably partitioned on-chip memory, high computational intensity allows us to implement and feed wide data paths with hundreds of floating point operators. By decoupling off-chip memory accesses from the computations, high memory bandwidth can be sustained, even for the irregular access pattern required by parts of the application. Using the Intel/Altera OpenCL SDK for FPGAs, we present different implementation variants for different polynomial orders of the method. In different phases of the algorithm, either computational or bandwidth limits of the Arria 10 platform are almost reached, thus outperforming a highly multithreaded CPU implementation by around 2x.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 189-196
OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured Meshes
The exploration of FPGAs as accelerators for scientific simulations has so far mostly been focused on small kernels of methods working on regular data structures, for example in the form of stencil computations for finite difference methods. In computational sciences, often more advanced methods are employed that promise better stability, convergence, locality and scaling. Unstructured meshes are shown to be more effective and more accurate, compared to regular grids, in representing computation domains of various shapes. Using unstructured meshes, the discontinuous Galerkin method preserves the ability to perform explicit local update operations for simulations in the time domain. In this work, we investigate FPGAs as target platform for an implementation of the nodal discontinuous Galerkin method to find time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing data reuse and fitting constant coefficients into suitably partitioned on-chip memory, high computational intensity allows us to implement and feed wide data paths with hundreds of floating point operators. By decoupling off-chip memory accesses from the computations, high memory bandwidth can be sustained, even for the irregular access pattern required by parts of the application. Using the Intel/Altera OpenCL SDK for FPGAs, we present different implementation variants for different polynomial orders of the method. In different phases of the algorithm, either computational or bandwidth limits of the Arria 10 platform are almost reached, thus outperforming a highly multithreaded CPU implementation by around 2x.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of Computational Science and Engineering
- Vol. 14 (2)
A Scala prototype to generate multigrid solver implementations for different problems and target multi-core platforms
Many problems in computational science and engineering involve partial differential equations and thus require the numerical solution of large, sparse (non)linear systems of equations. Multigrid is known to be one of the most efficient methods for this purpose. However, the concrete multigrid algorithm and its implementation depend highly on the underlying problem and hardware. Therefore, changes in the code or many different variants are necessary to cover all relevant cases. We report on a prototype implementation in Scala for a framework that enables abstract descriptions of PDEs, their discretisation, and their numerical solution via multigrid algorithms. From these, data structures and implementations of multigrid components required to solve elliptic PDEs on structured grids can be generated automatically. Two different test problems illustrate the potential of our approach for both CPU and GPU target platforms.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of Computational Science and Engineering
- Vol. 14 (2)
A Scala prototype to generate multigrid solver implementations for different problems and target multi-core platforms
Many problems in computational science and engineering involve partial differential equations and thus require the numerical solution of large, sparse (non)linear systems of equations. Multigrid is known to be one of the most efficient methods for this purpose. However, the concrete multigrid algorithm and its implementation depend highly on the underlying problem and hardware. Therefore, changes in the code or many different variants are necessary to cover all relevant cases. We report on a prototype implementation in Scala for a framework that enables abstract descriptions of PDEs, their discretisation, and their numerical solution via multigrid algorithms. From these, data structures and implementations of multigrid components required to solve elliptic PDEs on structured grids can be generated automatically. Two different test problems illustrate the potential of our approach for both CPU and GPU target platforms.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of Computational Science and Engineering
- Vol. 14 (2)
A Scala prototype to generate multigrid solver implementations for different problems and target multi-core platforms
International publishers of academic, scientific and professional journals since 1979.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of Computational Science and Engineering
- Vol. 14 (2)
A Scala prototype to generate multigrid solver implementations for different problems and target multi-core platforms
International publishers of academic, scientific and professional journals since 1979.
- 15 September 2016
- Published by Springer Nature
- p. 47-67
Systems of Partial Differential Equations in ExaSlang
- 15 September 2016
- Published by Springer Nature
- p. 47-67
Systems of Partial Differential Equations in ExaSlang
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 42-51
ExaSlang: A Domain-Specific Language for Highly Scalable Multigrid Solvers
High-Performance Computing (HPC) systems are becoming increasingly parallel and heterogeneous. As a consequence, HPC applications, such as simulation software, need to be especially designed towards these systems to achieve optimal performance. This, in turn, leads to higher complexity, making software engineers and scientists require a deep knowledge of the hardware and its technologies. As a remedy, domain-specific languages (DSLs) are a convenient technology for domain experts to describe settings and problems they want to solve using terms and models familiar to them. This specification is transformed into a target language, i. e., source code in another programming language or a binary executable, by a specialized compiler. We propose ExaSlang, a language for the specification of numerical solvers based on the multigrid method targeting distributed-memory systems. Furthermore, we present the transformation framework that drives the corresponding source-to-source compiler. It emits C++ code utilizing a hybrid OpenMP and MPI parallelization. Moreover, we substantiate our approach with scaling results of our code scaling up to the complete JUQUEEN cluster, consisting of 28,672 nodes, with a total of 458,752 cores.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 42-51
ExaSlang: A Domain-Specific Language for Highly Scalable Multigrid Solvers
High-Performance Computing (HPC) systems are becoming increasingly parallel and heterogeneous. As a consequence, HPC applications, such as simulation software, need to be especially designed towards these systems to achieve optimal performance. This, in turn, leads to higher complexity, making software engineers and scientists require a deep knowledge of the hardware and its technologies. As a remedy, domain-specific languages (DSLs) are a convenient technology for domain experts to describe settings and problems they want to solve using terms and models familiar to them. This specification is transformed into a target language, i. e., source code in another programming language or a binary executable, by a specialized compiler. We propose ExaSlang, a language for the specification of numerical solvers based on the multigrid method targeting distributed-memory systems. Furthermore, we present the transformation framework that drives the corresponding source-to-source compiler. It emits C++ code utilizing a hybrid OpenMP and MPI parallelization. Moreover, we substantiate our approach with scaling results of our code scaling up to the complete JUQUEEN cluster, consisting of 28,672 nodes, with a total of 458,752 cores.
- 29 September 2014
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 24 (03)
Experiments on Optimizing the Performance of Stencil Codes with SPL Conqueror
A standard technique for numerically solving elliptic partial differential equations on structured grids is to discretize them, and, then, to apply an efficient geometric multi-grid solver. Unfortunately, finding the optimal choice of multi-grid components and parameter settings is challenging and existing auto-tuning techniques fail to explain performance-optimal settings. To improve the state of the art, we explore whether recent work on optimizing configurations of product lines can be applied to the stencil-code domain. In particular, we extend the domain-independent tool SPL Conqueror in an empirical study to predict the performance-optimal configurations of three geometric multi-grid stencil codes: a program using HIPAcc, the evaluation prototype HSMGP, and a program using DUNE. For HIPAcc, we reach an prediction accuracy of 96%, on average, measuring only 21.4% of all configurations; we predict a configuration that is nearly optimal after measuring less than 0.3% of all configurations. For HSMGP, we predict performance with an accuracy of 97% including the performance-optimal configuration, while measuring 3.2% of all configurations. For DUNE, we predict performance of all configurations with an accuracy of 86% after measuring 3.3% of all configurations. The performance-optimal configuration is within the 0.5% configurations predicted to perform best.
- 29 September 2014
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 24 (03)
Experiments on Optimizing the Performance of Stencil Codes with SPL Conqueror
A standard technique for numerically solving elliptic partial differential equations on structured grids is to discretize them, and, then, to apply an efficient geometric multi-grid solver. Unfortunately, finding the optimal choice of multi-grid components and parameter settings is challenging and existing auto-tuning techniques fail to explain performance-optimal settings. To improve the state of the art, we explore whether recent work on optimizing configurations of product lines can be applied to the stencil-code domain. In particular, we extend the domain-independent tool SPL Conqueror in an empirical study to predict the performance-optimal configurations of three geometric multi-grid stencil codes: a program using HIPAcc, the evaluation prototype HSMGP, and a program using DUNE. For HIPAcc, we reach an prediction accuracy of 96%, on average, measuring only 21.4% of all configurations; we predict a configuration that is nearly optimal after measuring less than 0.3% of all configurations. For HSMGP, we predict performance with an accuracy of 97% including the performance-optimal configuration, while measuring 3.2% of all configurations. For DUNE, we predict performance of all configurations with an accuracy of 86% after measuring 3.3% of all configurations. The performance-optimal configuration is within the 0.5% configurations predicted to perform best.