Talk by I-Ting Angelina Lee (Washington University in St. Louis)
Talkat Algorithmic Foundations for Emerging Computing Technologies Boot Camp 2025 · 2025-09-08..09-12·
summary
Introduces a concrete solution for legacy-interoperable task-parallel stacks: a Thread-Local Memory Map (TLMM) plus a prototype runtime called Cilk-M that modifies Linux (~600 lines of kernel code) and hand-compiled benchmarks; on 16 cores Cilk-M matches or outperforms Cilk-5 on many kernels. Shows theory changes: steal overhead constant grows to O(S1 + D) so the bound becomes roughly T1/p + T∞ with extra fragmentation term. Separately implements a parallel, online race detector (SP-order with proactive group splitting) that scales across cores in practice.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 3:54Concurrency platforms work stealing
- 19:46Cactus stack problem legacy interoperability
- 27:42Virtual memory stack mapping
- 46:28Determinacy race detection task parallelism
- 1:04:45Series-parallel maintenance parallelizing
- 1:11:21Summary
related talks
01h 02mMemory and Compilers
11mEnabling Composition of Kernels and Compilers
01h 12mLightning Talks by Simons Institute Fellows
22mOpenMP-RT: Native Pragma Support for Real-Time Tasks and Synchronization with LLVM(…)
17mEMT: An OS Framework for New Memory Translation Architectures
19mMELF: Multivariant Executables for a Heterogeneous World
18mParallelism in a Region Inference Context
14mOn-Stack Replacement for Program Generators and Source-to-Source Compilers