Explore techniques for exploiting sparsity and redundancy in a 20-minute conference talk presented by Matthias Boehm at the SPARSE 2024 workshop. Gain insights into advanced optimization strategies for handling sparse data structures and redundant information in programming languages and systems. Discover how these techniques can improve performance and efficiency in various computational tasks. Attend this ACM SIGPLAN-sponsored presentation on June 25, 2024, as part of the PLDI 2024 conference to enhance your understanding of cutting-edge approaches in sparse computing.
Overview
Syllabus
[SPARSE24] Exploiting Sparsity and Redundancy
Taught by
ACM SIGPLAN
Related Courses
-
Extending the Scope of the Array Abstraction beyond Sparsity
-
Continuous Arrays - SPARSE 2024 Workshop
-
PDEs and Stencils - SPARSE 2024
-
Offloading-Efficient Sparse AI Systems
-
Exploiting Sparsity in Polynomial Optimization - Lecture 1
-
Designing and Exploiting Fast Algorithms for Polynomial Matrices - Lecture 1
