Timo Schneider
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
Timo Schneider has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Torsten Hoefler
ETH Zurich, Zurich, Switzerland
6 shared publications - Andrei Ivanov
ETH Zurich
2 shared publications - Andrew Lumsdaine
Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)
2 shared publications - Marcin Chrapek
ETH Zurich, Zurich, Switzerland
2 shared publications - Siyuan Shen
ETH Zurich, Zurich, Switzerland
2 shared publications - Tal Ben-Nun
Lawrence Livermore National Laboratory
2 shared publications
Latest Publications
- Open Access
- 27 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (2) , 1-25
STen: Productive and Efficient Sparsity in PyTorch
As deep learning models grow, sparsity is becoming an increasingly critical component of deep neural networks, enabling improved performance and reduced storage. However, existing frameworks offer poor support for sparsity. Specialized sparsity engines focus exclusively on sparse inference, while general frameworks primarily focus on sparse tensors in classical formats and neglect the broader sparsification pipeline necessary for using sparse models, especially during training. Further, existing frameworks are not easily extensible: adding a new sparse tensor format or operator is challenging and time-consuming. To address this, we propose STen, a sparsity programming model and interface for PyTorch whose key design insight is the decoupling of sparsity layouts, operators, and sparsifiers into composable, first-class abstractions that users can independently define and combine. An automatic dispatch mechanism selects the best available sparse implementation and transparently falls back to dense execution, allowing STen to support virtually all sparsification methods while enabling rapid prototyping without sacrificing performance for optimized paths. We demonstrate the versatility of STen by expressing existing sparsification techniques within its abstraction, achieving a code size reduction of over 2×. Finally, we develop a novel, high-performance grouped n : m sparsity layout for CPU inference at moderate sparsity, accelerating end-to-end BERT BASE inference by up to 3.2×. STen brings high performance and ease of use, making sparsity readily accessible for existing PyTorch models.
- 27 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (2) , 1-25
Open AccessSTen: Productive and Efficient Sparsity in PyTorch
As deep learning models grow, sparsity is becoming an increasingly critical component of deep neural networks, enabling improved performance and reduced storage. However, existing frameworks offer poor support for sparsity. Specialized sparsity engines focus exclusively on sparse inference, while general frameworks primarily focus on sparse tensors in classical formats and neglect the broader sparsification pipeline necessary for using sparse models, especially during training. Further, existing frameworks are not easily extensible: adding a new sparse tensor format or operator is challenging and time-consuming. To address this, we propose STen, a sparsity programming model and interface for PyTorch whose key design insight is the decoupling of sparsity layouts, operators, and sparsifiers into composable, first-class abstractions that users can independently define and combine. An automatic dispatch mechanism selects the best available sparse implementation and transparently falls back to dense execution, allowing STen to support virtually all sparsification methods while enabling rapid prototyping without sacrificing performance for optimized paths. We demonstrate the versatility of STen by expressing existing sparsification techniques within its abstraction, achieving a code size reduction of over 2×. Finally, we develop a novel, high-performance grouped n : m sparsity layout for CPU inference at moderate sparsity, accelerating end-to-end BERT BASE inference by up to 3.2×. STen brings high performance and ease of use, making sparsity readily accessible for existing PyTorch models.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 137-151
PerfDojo: Automated ML Library Generation for Heterogeneous Architectures
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 137-151
Open AccessPerfDojo: Automated ML Library Generation for Heterogeneous Architectures
- Open Access
- 8 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1005-1019
EDAN: Towards Understanding Memory Parallelism and Latency Sensitivity in HPC
- 8 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1005-1019
Open AccessEDAN: Towards Understanding Memory Parallelism and Latency Sensitivity in HPC
- Open Access
- 11 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-15
FuzzyFlow: Leveraging Dataflow To Find and Squash Program Optimization Bugs
- 11 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Open AccessFuzzyFlow: Leveraging Dataflow To Find and Squash Program Optimization Bugs
- 1 December 2009
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 19 (04) , 573-593
THE EFFECT OF NETWORK NOISE ON LARGE-SCALE COLLECTIVE COMMUNICATIONS
The effect of operating system (OS) noise on the performance of large-scale applications is a growing concern and ameliorating the influence of OS noise is a subject of active research. A related problem is that of network noise that arises from the shared use of the interconnection network by parallel processes of different allocations or other background activities. To characterize the effect of network noise on parallel applications, we conducted a series of experiments with a specially crafted benchmark and simulations. Experimental results show a decrease in the communication performance of a parallel reduction operation by a factor of 2 on 246 nodes on an InfiniBand fat-tree and by several orders of magnitude on a BlueGene/P torus. Simulations show how influence of network noise grows with the system size. Although network noise is not as well-studied as OS noise, our results clearly show that it is an important factor that must be considered when running and analyzing large-scale applications.
- 1 December 2009
- Published by World Scientific Pub Co Pte Ltd in Parallel Processing Letters
- Vol. 19 (04) , 573-593
THE EFFECT OF NETWORK NOISE ON LARGE-SCALE COLLECTIVE COMMUNICATIONS
The effect of operating system (OS) noise on the performance of large-scale applications is a growing concern and ameliorating the influence of OS noise is a subject of active research. A related problem is that of network noise that arises from the shared use of the interconnection network by parallel processes of different allocations or other background activities. To characterize the effect of network noise on parallel applications, we conducted a series of experiments with a specially crafted benchmark and simulations. Experimental results show a decrease in the communication performance of a parallel reduction operation by a factor of 2 on 246 nodes on an InfiniBand fat-tree and by several orders of magnitude on a BlueGene/P torus. Simulations show how influence of network noise grows with the system size. Although network noise is not as well-studied as OS noise, our results clearly show that it is an important factor that must be considered when running and analyzing large-scale applications.
- 1 May 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-7
A power-aware, application-based performance study of modern commodity cluster interconnection networks
Microbenchmarks have long been used to assess the performance characteristics of high-performance networks. It is generally assumed that microbenchmark results indicate the parallel performance of real applications. This paper reports the results of performance studies using real applications in a strictly controlled environment with different networks. In particular, we compare the performance of Myrinet and InfiniBand, and analyze them with respect to microbenchmark performance, real application performance and power consumption.
- 1 May 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-7
A power-aware, application-based performance study of modern commodity cluster interconnection networks
Microbenchmarks have long been used to assess the performance characteristics of high-performance networks. It is generally assumed that microbenchmark results indicate the parallel performance of real applications. This paper reports the results of performance studies using real applications in a strictly controlled environment with different networks. In particular, we compare the performance of Myrinet and InfiniBand, and analyze them with respect to microbenchmark performance, real application performance and power consumption.