2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.DC2022★ 2 cited
DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism
Sam Westrick, Larry Wang, Umut A. Acar
A number of problems in parallel computing require reasoning about the dependency structure in parallel programs. For example, dynamic race detection relies on efficient "on-the-fl…
cs.DS2020
Parallel Batch-dynamic Trees via Change Propagation
Umut A. Acar, Daniel Anderson, Guy E. Blelloch +2
The dynamic trees problem is to maintain a forest subject to edge insertions and deletions while facilitating queries such as connectivity, path weights, and subtree weights. Dynam…
cs.PL2018
Hierarchical Memory Management for Mutable State
Adrien Guatto, Sam Westrick, Ram Raghunathan +2
It is well known that modern functional programming languages are naturally amenable to parallel programming. Achieving efficient parallelism using functional languages, however, r…