POPL 2025
Sun 19 - Sat 25 January 2025 Denver, Colorado, United States
Sun 19 Jan 2025 14:00 - 15:30 at Patty Cake - MPL: Provably Efficient Parallel Programming
Sun 19 Jan 2025 16:00 - 17:30 at Patty Cake - MPL: Provably Efficient Parallel Programming

Parallel programming is infamously error-prone, not only due to correctness issues but also subtle performance problems which can easily negate the benefits of parallelism. MaPLe (MPL for short) is a parallel functional language that seeks to address these issues by providing strong guarantees on both safety and efficiency. A key feature of MPL is that it is provably efficient relative to the work-span cost model, preserving all logical parallelism in the source program while ensuring low overhead and high scalability in practice. In this tutorial, we will present MPL, overview the key ideas underpinning its design, and give a hands-on introduction to writing code with MPL and evaluating the performance of parallel code in practice.

Sun 19 Jan

Displayed time zone: Mountain Time (US & Canada) change

14:00 - 15:30
MPL: Provably Efficient Parallel ProgrammingTutorials at Patty Cake
14:00
90m
Tutorial
MPL: Provably Efficient Parallel Programming
Tutorials
P: Sam Westrick New York University
Link to publication
16:00 - 17:30
MPL: Provably Efficient Parallel ProgrammingTutorials at Patty Cake
16:00
90m
Tutorial
MPL: Provably Efficient Parallel Programming
Tutorials
P: Sam Westrick New York University
Link to publication