Managing Parallelism

Program

Algorithmic Foundations for Emerging Computing Technologies

Location

Calvin Lab auditorium

Date

Monday, Oct. 20 – Friday, Oct. 24, 2025

Back to calendar

All talks listed in Pacific Time. Schedule subject to change.

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

AMPC

Jakub Lacki (Google Research)

10:15 – 10:45 a.m.

Break

10:45 – 11:15 a.m.

The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems

Naama Ben David (Technion - Israel Institute of Technology)

11:15 – 11:45 a.m.

The Parallel Batch-Dynamic Model with Asynchronous Reads

Quanquan Liu (Yale University)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:30 p.m.

Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search

Julian Shun (MIT)

2:30 – 3 p.m.

Designing Parallel Data structures

Yan Gu (UC Riverside)

3 – 3:30 p.m.

Scalable Zero-Knowledge Proof Made Easy

TB Schardl (MIT CSAIL)

3:30 – 4:30 p.m.

Reception

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

The challenge of managing parallelism and data-movement for tensor computations on GPUs

Saday Sadayappan (University of Utah)

10:15 – 10:45 a.m.

Break

10:45 – 11:15 a.m.

Computational model and algorithms for tensor core units

Rezaul Chowdhury (Stony Brook University)

11:15 – 11:45 a.m.

Cost semantics and static resource analysis for CUDA

Stefan Muller (University of Connecticut)

11:45 a.m. – 12:15 p.m.

Unstructured Sparsity Meets Tensor Cores: Lessons from Sparse Attention and MoE

Aparna Chandramowlishwaran (UC Irvine)

12 – 3 p.m.

Lunch (on your own)

3 – 3:30 p.m.

Break (Reception for RMK Lecture)

3:30 – 4:30 p.m.

Richard M. Karp Distinguished Lecture

Robert Tarjan (Princeton University)

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

Parallelism in modern sparse solvers

Aydin Buluc (Lawrence Berkeley Lab)

10:15 – 10:45 a.m.

Break

10:45 – 11:15 a.m.

Register Tiling for Unstructured Sparsity in Neural Network Inference

Maryam Mehri Dehnavi (NVIDIA Research and University of Toronto)

11:15 – 11:45 a.m.

Automatic Parallelism Management

Sam Westrick (NYU)

12 – 2 p.m.

Lunch (on your own)

2 – 2:30 p.m.

Scalable Parallel Algorithms

Yihan Sun (UC Riverside)

2:30 – 3 p.m.

Scaling Parallel Algorithms to Massive Datasets using Multi-SSD Machines

Laxman Dhulipala (University of Maryland)

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

Parallel Graph Algorithms

Jeremy Fineman (Georgetown University)

10:15 – 10:45 a.m.

Break

10:45 – 11:15 a.m.

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds

Nairen Cao (NYU)

11:15 – 11:45 a.m.

Load Balancing with Duration Predictions

Yossi Azar (Tel-Aviv University)

11:45 a.m. – 2 p.m.

Lunch (on your own)

2 – 2:30 p.m.

Parallel Cluster-BFS and Applications to Shortest Paths

Letong Wang (UC Riverside)

2:30 – 3 p.m.

Combining and Aggregating for Fast Synchronization

Panagiota Fatourou (University of Crete)

8:30 – 9 a.m.

Coffee and Check-In

9 – 9:30 a.m.

Approximation hardness and online algorithms for resource scheduling

Rathish Das (University of Houston)

9:30 – 10 a.m.

Dynamic Data Structures and Memory Management on GPUs

Prashant Pandey (Northeastern University)

10:15 – 10:45 a.m.

Break

10:45 – 11:15 a.m.

On Interplanetary and Relativistic Distributed Computing

Siddhartha Jayanti (Dartmouth College)

11:15 – 11:45 a.m.

Talk by

TBD TBD ()