Keynote (Fredrik Kjolstad): Portable Compilation of Sparse Computation
Hardware is becoming more diverse and architects are designing a host of new accelerators. Different types of accelerators are being deployed in different data centers, making it harder to port applications across machines and across clouds. I will discuss the design of compilers for data-intensive application in heterogeneous systems. I will then give an outline for how to compile sparse tensor algebra to the major classes of heterogeneous hardware: CPUs, fixed-function accelerators, GPUs, distributed machines, and streaming dataflow accelerators.
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.
Sat 17 JunDisplayed time zone: Eastern Time (US & Canada) change
11:20 - 12:30 | |||
11:20 30mTalk | Keynote (Fredrik Kjolstad): Portable Compilation of Sparse Computation DRAGSTERS Fredrik Kjolstad Stanford University | ||
11:50 20mTalk | F-IVM: Analytics over Relational Databases under Updates DRAGSTERS Ahmet Kara University of Zurich, Milos Nikolic University of Edinburgh, Dan Olteanu University of Zurich, Haozhe Zhang University of Zurich | ||
12:10 20mTalk | TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators DRAGSTERS Nandeeka Nayak University of Illinois at Urbana-Champaign, Toluwanimi O. Odemuyiwa University of California, Davis, Shubham Ugare University of Illinois at Urbana-Champaign, Christopher W. Fletcher University of Illinois--Urbana Champaign, Michael Pellauer Nvidia, Joel S Emer MIT/NVIDIA | ||
