PLDI 2023 (series) / CTSTA 2023 (series) / Compiler Techniques for Sparse Tensor Algebra /
Introduction
Sun 18 Jun 2023 09:00 - 09:05 at Magnolia 4 - CTSTA: Session 1
Fredrik Kjolstad is an Assistant Professor in Computer Science at Stanford University. He works on topics in compilers and programming models, with an emphasis on fast compilation and compilers for sparse computing problems where we need to separate the algorithms from data representation. He has received the MIT EECS First Place George M. Sprowls PhD Thesis Award in Computer Science, the NSF CAREER Award, the Rosing Award, an Adobe Fellowship, a Google Research Scholarship, and best paper awards at EuroMPI 2013 and OOPSLA 2017 and 2021.
Sun 18 JunDisplayed time zone: Eastern Time (US & Canada) change
Sun 18 Jun
Displayed time zone: Eastern Time (US & Canada) change
09:00 - 11:00 | |||
09:00 5mDay opening | Introduction CTSTA Fredrik Kjolstad Stanford University | ||
09:05 15mTalk | Software and Hardware for Sparse ML CTSTA Fredrik Kjolstad Stanford University | ||
09:20 15mTalk | Integrating Data Layout into Compilers and Code Generators CTSTA Mary Hall University of Utah | ||
09:35 15mTalk | Tackling the challenges of high-performance graph analytics at compiler level CTSTA Gokcen Kestor Pacific Northwest National Laboratory | ||
09:50 10mPanel | Discussion CTSTA | ||
10:00 5mBreak | BreakSocial CTSTA | ||
10:05 15mTalk | Challenges and Opportunities for Sparse Compilers in LLM CTSTA Zihao Ye University of Washington | ||
10:20 15mTalk | The Sparse Abstract Machine CTSTA Olivia Hsu Stanford University | ||
10:35 15mTalk | TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators CTSTA Nandeeka Nayak University of Illinois at Urbana-Champaign | ||
10:50 10mPanel | Discussion CTSTA | ||
