Provably Efficient Parallel Language Design
Sam Westrick
- NYU
Nov. 13, 2026, 3:30 p.m. - Nov. 13, 2026, 4:30 p.m.
ENGMC 11
Hosted by: Brigitte Pientka
Advances in safety for parallelism and concurrency have brought parallelism to the mainstream. However, a major hurdle remains for non-experts: no language today is able to provide strong guarantees on parallel performance. In practice, it is common to experience performance issues that require significant expertise to identify and debug, such as unexpected slowdowns and excessive memory consumption. In this talk, I will frame these problems in terms of assigning a cost semantics to a parallel language, making it possible to specify and identify language-level performance problems. I will then overview two ongoing lines of research in my group which offer provable guarantees on performance, at the level of the programming language itself: (1) parallel garbage collection based on “disentanglement”, and (2) automatic parallelism management, a technique for automatically controlling the overheads of task creation. Both lines of work are implemented in a full-fledged language called MaPLe (
https://github.com/mpllang/mpl) which extends Standard ML with parallelism. Using MaPLe, we demonstrate that these techniques are not just provably efficient in theory, but also highly efficient in practice.
Sam Westrick is an Assistant Professor of Computer Science at New York University, where he leads the NYU ParCour lab and is also a member of the NYU ACSys group. His research focuses on parallel computing, programming languages, formal methods, and parallel algorithms. His work has been recognized with distinguished paper awards at conferences including POPL, ICFP, SPAA, and QCE. Sam completed his PhD at Carnegie Mellon University in 2022, and in 2023, he received the ACM SIGPLAN Dissertation Award for his work on MaPLe, a provably efficient compiler and run-time system for parallel functional programming on multicore shared-memory architectures.