Managing Memory

Program

Algorithmic Foundations for Emerging Computing Technologies

Location

Calvin Lab auditorium

Date

Monday, Sept. 29 – Friday, Oct. 3, 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.

The Evolution of Memory Technologies

Rajeev Balasubramonian (University of Utah)

10:15 – 10:45 a.m.

Break

10:45 – 11:25 a.m.

Algorithmic management of phase-change memory

Kirk Pruhs (University of Pittsburgh)

11:25 a.m. – 12:05 p.m.

Optimal SSD Management with Predictions

Seffi Naor (Technion - Israel Institute of Technology)

12:05 – 3 p.m.

Lunch (on your own)

3 – 3:30 p.m.

The ERA Theorem for Safe Memory Reclamation

Erez Petrank (Technion - Israel Institute of Technology)

3:30 – 4 p.m.

Implementing wait-free space bounded shared memory primitives on concurrent systems

Phillipp Woefel (University of Calgary)

4 – 5 p.m.

Reception

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

Extending Moore’s Law with Low-Cost Memory Reliability

Moinuddin Qureshi (Georgia Tech)

10:15 – 10:45 a.m.

Break

10:45 – 11:25 a.m.

Managing High-Bandwidth Memory is a Parallel Scheduling Problem

Kunal Agrawal (Washington University in St. Louis)

11:25 a.m. – 12:05 p.m.

New Tools for Peak Memory Scheduling

Manish Purohit (Google)

12:05 – 3 p.m.

Lunch (on your own)

3 – 3:30 p.m.

Break (Reception for RMK Lecture)

3:30 – 4:30 p.m.

Virtualization and the Cost of Indirection | Richard M. Karp Distinguished Lecture

Martín Farach-Colton (NYU)

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

Processing-in-Memory: Theory and Practice

Phillip Gibbons (Carnegie Mellon University)

10:15 – 10:45 a.m.

Break

10:45 – 11:25 a.m.

PIM-tree: A Skew-resistant Index for Processing-in-Memory

Hongbo Kang (Tsinghua University)

11:25 a.m. – 12:05 p.m.

Principled algorithm, data structure and system design for Processing-in-Memory (PIM)”

Yiwei Zhao (Carnegie Mellon University)

12:05 – 3 p.m.

Lunch (on your own)

3 – 3:40 p.m.

Space and Time Bounded Multiversion Garbage Collection

Eric Ruppert (York University)

3:40 – 4:20 p.m.

The power of collective memory

Andrea Richa (Arizona State University)

8:30 – 9 a.m.

Coffee and Check-In

9 – 10:15 a.m.

Load balance and cache affinity: Friends, foes, or frenemies?

Aaron Archer (Google)

10:15 – 10:45 a.m.

Break

10:45 – 11:05 a.m.

Succinct Preferential Attachment Graphs

Sebastian Wild (University of Marburg & University of Liverpool)

11:05 – 11:25 a.m.

(Almost) Perfect Discrete Iterative Load Balancing

Petra Berenbrink (University of Hamburg)

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

Privacy-preserving decentralized memory for federated learning (aka secure MPC)

Jared Saia (University of New Mexico)

12:05 – 3 p.m.

Lunch (on your own)

3 – 3:20 p.m.

Document retrieval in external memory

Rahul Shah (Louisiana State University)

3:20 – 3:40 p.m.

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams

Soheil Behnezhad (Northeastern University)

8:30 – 9 a.m.

Coffee and Check-In

9 – 9:35 a.m.

How to Manage High-Bandwidth Memory Automatically

Guy Blelloch (Carnegie Mellon University)

9:35 – 10:10 a.m.

Concurrent Data Structures in Persistent Memory

Naama Ben David (Technion - Israel Institute of Technology)

10:10 – 10:45 a.m.

Break

10:45 a.m. – 12 p.m.

Mosic Pages and Tiny Pointers

Alex Conway (Cornell Tech)