http://fast-code.csail.mit.edu/ MIT Fast Code Seminar Algorithms, Compilers, Accelerators, and Whatever It Takes Description The MIT Fast Code Seminar is a seminar that covers the latest research topics in the theory and practice of performance engineering. Topics of interest include, but are not limited to, algorithm design and implementation; techniques for improving parallelism and locality; high-performance programming languages and frameworks; compilers for parallel code; tools for analyzing performance; hardware techniques for improving performance; parallel and concurrent data structures; models and algorithms for emerging technologies; high-performance solutions for databases, operating systems, networking, and artificial intelligence; and just plain clever hacks. To receive seminar announcements, please subscribe to this mailing list. This seminar meets on Wednesdays at 4-5pm EST via Zoom. Videos for most talks are available by request to Linda Lynch. Fall 2022 Schedule Date Speaker Affiliation Title Wednesday David Rutgers Dynamic Graph Connectivity: To 9/14/2022 Tench University Infinity And Beyond Wednesday Harsha Microsoft Approximate Nearest Neighbor Search 9/28/2022 Simhadri Research algorithms for web-scale search and recommendation Wednesday Rezaul Stony Brook Fast Stencil Computations using FFT 10/5/2022 Chowdhury University and Gaussian Approximations Previous Seminars Date Speaker Affiliation Title Wednesday Hans Queen's Memory Locality Optimisations 6/1/2022 Vandierendonck University for Graph Processing Belfast Wednesday Bridging Theory and Practice 4/20/2022 Jessica Shi MIT in Parallel Subgraph Computations Wednesday Neil Thompson MIT How close are algorithms to 4/6/2022 being optimal? Wednesday William Linear Probing Revisited: 2/16/2022 Kuszmaul MIT Tombstones Mark the Demise of Primary Clustering Wednesday Yuanhao Wei CMU Multi-point Queries on 12/8/2021 Concurrent Data Structures Wednesday Naama VMware Algorithms for Practical 11/17/ Ben-David Research Distributed Agreement 2021 The Demikernel Datapath OS Wednesday Irene Zhang Microsoft Architecture for 11/3/2021 Research Microsecond-scale Datacenter Systems Wednesday Northeastern Productivity and Performance 10/13/ Jan Vitek University Reconciled: The Julia Story 2021 Wednesday Daniel Lemire University of Parsing numbers at a gigabyte 5/12/2021 Quebec per second Wednesday Xuhao Chen MIT Software and Hardware Systems 4/28/2021 for Emerging Graph Algorithms Wednesday Data Structure Design for 4/7/2021 Helen Xu MIT Skewed Dynamic Graph Processing Wednesday SuiteSparse:GraphBLAS: graph 3/31/2021 Tim Davis Texas A&M algorithms in the language of sparse linear algebra Wednesday Martin Rutgers The Algorithmics of Address 3/24/2021 Farach-Colton University Translation Wednesday Maryam Mehri University of Inspecting Irregular 3/17/2021 Dehnavi Toronto Computation Patterns to Generate Fast Code Wednesday Disentanglement: Provably 3/10/2021 Sam Westrick CMU Efficient Parallel Functional Programming (Slides) Wednesday Edgar UIUC Scalable Algorithms for 2/24/2021 Solomonik Tensor Computations (Slides) Monday 1/ Indiana Computational Building Blocks 25/2021 Ariful Azad University for Machine Learning on Graphs (Slides) Monday 1/ Xuehai Qian USC High Performance Graph Mining 11/2021 Systems (Slides) Taichi: A Language for Monday 12 Yuanming Hu MIT High-Performance Computation /7/2020 on Spatially Sparse Data Structures Monday 11 Efficiently Exploiting /30/2020 Scott Beamer UC Santa Cruz Low-Activity Factors to Accelerate RTL Simulation Monday 11 Bradley Everyone Loves File: File /9/2020 Kuszmaul Google Storage Service (FSS) in Oracle Cloud Infrastructure Monday 11 Michael Bender Stony Brook Filters /2/2020 University Monday 10 Purdue Approximation: A Paradigm for /26/2020 Alex Pothen University Designing Parallel Graph Algorithms Automatic Derivation of Monday 10 Rezaul Stony Brook Efficient Parallel Recursive /19/2020 Chowdhury University Divide-&-Conquer Algorithms for Dynamic Programs Monday 9/ Michael ICSI and UC ADAHESSIAN: An Adaptive 28/2020 Mahoney Berkeley Second Order Optimizer for Machine Learning Carnegie SPIRAL's Operator Language: Monday 9/ Franz Mellon From Textbook Math to High 21/2020 Franchetti University Performance - With Correctness Guarantees Communication-avoiding Monday 8/ James Demmel UC Berkeley algorithms for linear 10/2020 algebra, machine learning and beyond UC Berkeley/ Genomic Analysis and Learning Monday 8/ Kathy Yelick Lawrence at Scale: Mapping Irregular 3/2020 Berkeley Computations to Advanced National Lab Architectures Larry Rudolph Two Sigma QuickQuery: GPU-Based Monday 7/ and Investments, Approximate Query Processing 27/2020 Steven Martin LP/ for Sub-Second Exploration at MIT CSAIL Scale Monday 7/ Format Abstractions for 20/2020 Stephen Chou MIT Sparse Tensor Algebra Compilation Monday 7/ Michael Karlsruhe Engineering Scalable Parallel 13/2020 Axtmann and Institute Sorting Algorithms Peter Sanders of Technology Monday 6/ Umit Fast graph analytics on 29/2020 Catalyurek Georgia Tech heterogenous and deep-memory architectures Lawrence Sparse Matrices Beyond Monday 6/ Aydin Buluc Berkeley Solvers: Graphs, Biology, and 22/2020 National Lab/ Machine Learning (Slides) UC Berkeley Monday 6/ Wen-Mei Hwu UIUC Fast GPU Code for Graphs ( 15/2020 Slides) Monday 6/ New Jersey Solving Global Grand 8/2020 David Bader Institute Challenges with High of Technology Performance Data Analytics Monday 6/ John Owens UC Davis Dynamic Data Structures on 1/2020 the GPU Monday 5/ Alex Aiken Stanford Program Optimization for 11/2020 Machine Learning Monday 5/ Ariya Shajii MIT Seq: a high-performance 4/2020 language for bioinformatics Monday 4/ Neil Thompson MIT How fast are Algorithms 20/2020 & Yash Sherry Improving? Tuesday 2 Safe Parallel Programming -- /18/2020 S. Tucker Taft AdaCore ParaSail, Ada 202X, OpenMP, and Rust Duke Monday 11 Bruce Maggs University and A Speed-of-Light Internet /25/2019 Emerald Service Provider Innovations Monday 11 Charith Mendis MIT How to Modernize Compiler /18/2019 Technology GraphIt: A Domain-Specific Monday 11 Yunming Zhang MIT Language for Writing /4/2019 High-Performance Graph Applications Monday 10 Alex Conway Rutgers SplinterDB: Closing the /21/2019 University Bandwidth Gap on NVMe Monday 9/ Valentin MIT Julia: Making dynamic 30/2019 Churavy programs run fast Monday 9/ Riyadh Tiramisu: A Polyhedral 23/2019 Baghdadi MIT Compiler for Dense and Sparse Deep Learning NVIDIA Monday 9/ Corporation 16/2019 Bill Dally and Domain-Specific Accelerators Stanford University Tuesday 8 Laxman Carnegie Algorithms and Systems for /27/2019 Dhulipala Mellon Processing Massive Static and University Evolving Graphs Tapir: Embedding Recursive Tuesday 8 Tao B. Schardl MIT Fork-Join Parallelism into /20/2019 LLVM's Intermediate Representation MIT Lincoln Tuesday 8 Jeremy Kepner Laboratory Optimal system settings: How /6/2019 Supercomputing to not lose before you begin Center Tuesday 7 I-Ting Washington Advances in Determinacy Race /30/2019 Angelina Lee University Detection for Task-Parallel in St. Louis Code Tuesday 7 Maurice Brown Speculative Concurrency for /23/2019 Herlihy University Ethereum Smart Contracts Tuesday 7 AutoML for Efficiently /16/2019 Song Han MIT Designing Efficient Neural Network Architectures Tuesday 7 Fredrik MIT The Sparse Tensor Algebra /9/2019 Kjolstad Compiler Tuesday 6 Charles MIT The Resurgence of Software /11/2019 Leiserson Performance Engineering Organizers Julian Shun (lead organizer) Saman Amarasinghe Adam Belay Charles Leiserson Tao B. Schardl Accessibility