MIT Stata Center

Invited Workshop on Compiler Techniques for Sparse Tensor Algebra

Cambridge MA, Janury 26th

There has been a lot of recent interest and innovation in compiler technology for high performance sparse tensor computation. This workshop will bring together relevant parties from academia and industry to discuss individual approaches, how they relate to each other and if the ideas can be combined. We envision this workshop to be a one to two day event, held in Cambridge MA in late January.


Fredrik Kjolstad and Saman Amarasinghe


There will be seven session of three speakers. The sessions will consist of three ten minute talks followed by a thirty minute speaker and room discussion.
Time Session
8:00 - 8:20 Registration
8:20 - 8:30 Welcome
8:30 - 9:30 Sparse Polyhedral Optimization
Mary Hall (University of Utah)
Cathie Olschanowsky (Boise State University)
Michelle Strout (University of Arizona)
9:30 - 9:45 Break
9:45 - 10:45 Sparse Code Optimization
Muthu Baskaran (Reservoir Labs)
Jee Choi (Oregon State University)
Duane Merrill and Michael Garland (NVIDIA Research)
10:45 - 11:00 Break
11:00 - 12:00 Sparse Algorithms and Data Structures
Jiajia Li (Pacific Northwest National Laboratory)
Shaden Smith (Intel Labs)
Edgar Solomonik (University of Illinois at Urbana-Champaign)
12:00 - 1:00 Lunch
1:00 - 2:00 Tensor Compilers I
Albert Cohen (Google)
P. (Saday) Sadayappan (Ohio State University)
Fredrik Kjolstad (MIT)
2:00 - 2:15 Break
2:15 - 3:15 Tensor Compilers II
Stephen Chou (MIT)
Maryam Dehnavi (University of Toronto)
3:15 - 3:30 Break
3:30 - 4:30 Hardware
Hongbo Rong (Intel Labs)
Song Han (MIT)
Chris Fletcher (University of Illinois at Urbana-Champaign)
4:30 - 4:45 Break
4:45 - 5:45 Applications
Richard Mills (Argonne National Laboratory)
Miles Stoudenmire (Flatiron Institute)
Eduard Valeyev (Virginia Tech)
5:45 - 6:00 Discussion
6:00 - 8:00 Dinner and Poster Session


Room 32-155
MIT Ray and Maria Stata Center
32 Vassar St
Cambridge, MA 02139