Spring 2026

This semester we meet Thursdays at 12:00pm in 60FA 527.

Date Leading Paper(s)
Jan 22 Vishnu Redwood: Flexible and Portable Heterogeneous Tree Traversal Workloads
Jan 29 Seong-Heon The Key to a Data Parallel Compiler
Feb 5 Darshan Almost Deterministic Work Stealing
Feb 12 — (cancelled)
Feb 19 Vishnu Scheduling Multithreaded Computations by Work Stealing
Feb 26 Vishnu Thread Scheduling for Multiprogrammed Multiprocesssors
Mar 5 TBD  
Mar 12 — (Cancelled)
Mar 19 — (Cancelled – Spring Break)
Mar 26 TBD  
Apr 2 TBD  
Apr 9 TBD  
Apr 16 TBD  
Apr 23 TBD  
Apr 30 TBD  

Fall 2025

Starting Fall 2025, we meet weekly every Thursday at 11:30 a.m. in Sam’s office (Room 308, 60 FA) to discuss research related to parallel programming languages, systems, and algorithms.

Date Paper Title
09/11 A Work-Efficient Algorithm for Parallel Depth First Search
09/18 A Top-Down Parallel Semisort, High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
09/25 Cancelled
10/02 Towards Zero Spawn Overhead: Work Stealing Without Deques
10/09 ICFP / SPLASH ‘25
10/16 ICFP / SPLASH ‘25
10/23 Managing Parallelism Workshop
10/30 Efficient tree-traversals: reconciling parallelism and dense data representations, LoCal: a language for programs operating on serialized data
11/06 Previous week’s papers continued with follow-up: Garbage Collection for Mostly Serialized Heaps
11/13 Cancelled
11/20 Kill-safe synchronization abstractions
11/27 Thanksgiving 🦃
12/04 Cancelled
12/11 Finals Week