Thomas Rauber
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
Research Subjects
Thomas Rauber has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
Gudula Rünger
19 shared publications- Gudula Rünger
Chemnitz University of Technology
19 shared publications Matthias Korch
4 shared publicationsCarsten Scholtes
2 shared publicationsGudula Nger
2 shared publicationsGudula Runger
Chemnitz University of Technology
2 shared publications
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 195-209
How Efficient are the Efficient Cores?—An Experimental Evaluation of Energy Efficiency in Asymmetric Multicore Processors
- 15 August 2026
- Published by Springer Nature
- p. 195-209
How Efficient are the Efficient Cores?—An Experimental Evaluation of Energy Efficiency in Asymmetric Multicore Processors
- 18 May 2026
- Published by Springer Nature
- p. 3-25
Variant Selection of Parallel Applications to Achieve Pareto-Optimal Executions Concerning Time and Energy
- 18 May 2026
- Published by Springer Nature
- p. 3-25
Variant Selection of Parallel Applications to Achieve Pareto-Optimal Executions Concerning Time and Energy
- 1 April 2025
- Published by Springer Nature
- p. 17-33
Trade-Off Between Energy Consumption and Solution Accuracy for a Multithreaded Spectral Method Implementation
- 1 April 2025
- Published by Springer Nature
- p. 17-33
Trade-Off Between Energy Consumption and Solution Accuracy for a Multithreaded Spectral Method Implementation
- 7 October 2023
- Published by Springer Nature
- p. 18-33
Performance and Energy Evaluation for Solving a Schrödinger-Poisson System on Multicore Processors
- 7 October 2023
- Published by Springer Nature
- p. 18-33
Performance and Energy Evaluation for Solving a Schrödinger-Poisson System on Multicore Processors
- Open Access
- 25 August 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (4) , 3484-3515
A performance- and energy-oriented extended tuning process for time-step-based scientific applications
Scientific application codes are often long-running time- and energy-consuming parallel codes, and the tuning of these methods towards the characteristics of a specific hardware is essential for a good performance. However, since scientific software is often developed over many years, the application software usually survives several hardware generations, which might make a re-tuning of the existing codes necessary. To simplify the tuning process, it would be beneficial to have software with inherent tuning possibilities. In this article, we explore the possibilities of tuning methods for time-step-based applications. Two different time-step-based application classes are considered, which are solution methods for ordinary differential equations and particle simulation methods. The investigation comprises a broad range of tuning possibilities, starting from the choice of algorithms, the parallel programming model, static implementation variants, input characteristics as well as hardware parameters for parallel execution. An experimental investigation shows the different characteristics of the application classes on different multicore systems. The results show that a combination of offline and online tuning leads to good tuning results. However, due to the different input characteristics of the two application classes, regular versus irregular, different tuning aspects are most essential.
- 25 August 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (4) , 3484-3515
Open AccessA performance- and energy-oriented extended tuning process for time-step-based scientific applications
Scientific application codes are often long-running time- and energy-consuming parallel codes, and the tuning of these methods towards the characteristics of a specific hardware is essential for a good performance. However, since scientific software is often developed over many years, the application software usually survives several hardware generations, which might make a re-tuning of the existing codes necessary. To simplify the tuning process, it would be beneficial to have software with inherent tuning possibilities. In this article, we explore the possibilities of tuning methods for time-step-based applications. Two different time-step-based application classes are considered, which are solution methods for ordinary differential equations and particle simulation methods. The investigation comprises a broad range of tuning possibilities, starting from the choice of algorithms, the parallel programming model, static implementation variants, input characteristics as well as hardware parameters for parallel execution. An experimental investigation shows the different characteristics of the application classes on different multicore systems. The results show that a combination of offline and online tuning leads to good tuning results. However, due to the different input characteristics of the two application classes, regular versus irregular, different tuning aspects are most essential.
- Open Access
Offsite Autotuning Approach -- Performance Model Driven Autotuning Applied to Parallel Explicit ODE Methods
Autotuning techniques are a promising approach to minimize the otherwise tedious manual effort of optimizing scientific applications for a specific target platform. Ideally, an autotuning approach is capable of reliably identifying the most efficient implementation variant(s) for a new target system or new characteristics of the input by applying suitable program transformations and analytic models. In this work, we introduce Offsite, an offline autotuning approach which automates this selection process at installation time by rating implementation variants based on an analytic performance model without requiring time-consuming runtime experiments. From abstract multilevel YAML description languages, Offsite automatically derives optimized, platform-specific and problem-specific code of possible implementation variants and applies the performance model to these implementation variants. We apply Offsite to parallel numerical methods for ordinary differential equations (ODEs). In particular, we investigate tuning a specific class of explicit ODE solvers (PIRK methods) for various initial value problems (IVPs) on shared-memory systems. Our experiments demonstrate that Offsite is able to reliably identify a set of the most efficient implementation variants for given test configurations (ODE solver, IVP, platform) and is capable of effectively handling important autotuning scenarios.
Open AccessOffsite Autotuning Approach -- Performance Model Driven Autotuning Applied to Parallel Explicit ODE Methods
Autotuning techniques are a promising approach to minimize the otherwise tedious manual effort of optimizing scientific applications for a specific target platform. Ideally, an autotuning approach is capable of reliably identifying the most efficient implementation variant(s) for a new target system or new characteristics of the input by applying suitable program transformations and analytic models. In this work, we introduce Offsite, an offline autotuning approach which automates this selection process at installation time by rating implementation variants based on an analytic performance model without requiring time-consuming runtime experiments. From abstract multilevel YAML description languages, Offsite automatically derives optimized, platform-specific and problem-specific code of possible implementation variants and applies the performance model to these implementation variants. We apply Offsite to parallel numerical methods for ordinary differential equations (ODEs). In particular, we investigate tuning a specific class of explicit ODE solvers (PIRK methods) for various initial value problems (IVPs) on shared-memory systems. Our experiments demonstrate that Offsite is able to reliably identify a set of the most efficient implementation variants for given test configurations (ODE solver, IVP, platform) and is capable of effectively handling important autotuning scenarios.
- Open Access
- 2 April 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (1) , 263-291
Autotuning based on frequency scaling toward energy efficiency of blockchain algorithms on graphics processing units
Energy-efficient computing is especially important in the field of high-performance computing (HPC) on supercomputers. Therefore, automated optimization of energy efficiency during the execution of a compute-intensive program is desirable. In this article, a framework for the automatic improvement of the energy efficiency on NVIDIA GPUs (graphics processing units) using dynamic voltage and frequency scaling is presented. As application, the mining of crypto-currencies is used, since in this area energy efficiency is of particular importance. The framework first determines the energy-optimal frequencies for each available currency on each GPU of a computer automatically. Then, the mining is started, and during a monitoring phase it is ensured that always the most profitable currency is mined on each GPU, using optimal frequencies. Tests with different GPUs show that the energy efficiency, depending on the GPU and the currency, can be increased by up to 84% compared to the usage of the default frequencies. This in turn almost doubles the mining profit.
- 2 April 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (1) , 263-291
Open AccessAutotuning based on frequency scaling toward energy efficiency of blockchain algorithms on graphics processing units
Energy-efficient computing is especially important in the field of high-performance computing (HPC) on supercomputers. Therefore, automated optimization of energy efficiency during the execution of a compute-intensive program is desirable. In this article, a framework for the automatic improvement of the energy efficiency on NVIDIA GPUs (graphics processing units) using dynamic voltage and frequency scaling is presented. As application, the mining of crypto-currencies is used, since in this area energy efficiency is of particular importance. The framework first determines the energy-optimal frequencies for each available currency on each GPU of a computer automatically. Then, the mining is started, and during a monitoring phase it is ensured that always the most profitable currency is mined on each GPU, using optimal frequencies. Tests with different GPUs show that the energy efficiency, depending on the GPU and the currency, can be increased by up to 84% compared to the usage of the default frequencies. This in turn almost doubles the mining profit.
- 10 October 2018
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 31 (19)
A scheduling selection process for energy‐efficient task execution on DVFS processors
Summary: The efficient execution of parallel programs with respect to execution time and energy consumption is a major concern, and often, scheduling methods are used to achieve a good performance. In this article, we consider the problem of scheduling a set of independent tasks on a parallel system with homogeneous execution units providing frequency scaling. The set of tasks has the property that the tasks exhibit a task‐specific inhomogeneous and non‐linear behavior of their specific time‐energy relation. In addition, it is assumed that execution time and energy consumption behave in a non‐linear manner with respect to frequency scaling. For the assignment of these tasks to execution units, we propose a scheduling selection process combining scheduling algorithms, which determine a task assignment, with a subsequent selection of frequency scaling, which we call schedule execution modes. This process builds a rich set of alternative schedule execution modes from which efficient (or Pareto‐optimal) schedule execution modes can be selected. Experiments are done for the SPEC CPU benchmarks. Experimental results illustrate that the enriched scheduling process leads to task assignments resulting in an efficient execution on DVFS processors.
- 10 October 2018
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 31 (19)
A scheduling selection process for energy‐efficient task execution on DVFS processors
Summary: The efficient execution of parallel programs with respect to execution time and energy consumption is a major concern, and often, scheduling methods are used to achieve a good performance. In this article, we consider the problem of scheduling a set of independent tasks on a parallel system with homogeneous execution units providing frequency scaling. The set of tasks has the property that the tasks exhibit a task‐specific inhomogeneous and non‐linear behavior of their specific time‐energy relation. In addition, it is assumed that execution time and energy consumption behave in a non‐linear manner with respect to frequency scaling. For the assignment of these tasks to execution units, we propose a scheduling selection process combining scheduling algorithms, which determine a task assignment, with a subsequent selection of frequency scaling, which we call schedule execution modes. This process builds a rich set of alternative schedule execution modes from which efficient (or Pareto‐optimal) schedule execution modes can be selected. Experiments are done for the SPEC CPU benchmarks. Experimental results illustrate that the enriched scheduling process leads to task assignments resulting in an efficient execution on DVFS processors.
- 23 March 2018
- Published by Springer Nature
- p. 185-196
Comparison of Time and Energy Oriented Scheduling for Task-Based Programs
- 23 March 2018
- Published by Springer Nature
- p. 185-196
Comparison of Time and Energy Oriented Scheduling for Task-Based Programs