Sam Westrick
YOU?
Author Swipe
View article: Automatic Parallelism Management
Automatic Parallelism Management Open
On any modern computer architecture today, parallelism comes with a modest cost, born from the creation and management of threads or tasks. Today, programmers battle this cost by manually optimizing/tuning their codes to minimize the cost …
View article: DisLog: A Separation Logic for Disentanglement
DisLog: A Separation Logic for Disentanglement Open
Disentanglement is a run-time property of parallel programs that facilitates task-local reasoning about the memory footprint of parallel tasks. In particular, it ensures that a task does not access any memory locations allocated by another…
View article: Efficient Parallel Functional Programming with Effects
Efficient Parallel Functional Programming with Effects Open
Although functional programming languages simplify writing safe parallel programs by helping programmers to avoid data races, they have traditionally delivered poor performance. Recent work improved performance by using a hierarchical memo…
View article: Entanglement detection with near-zero cost
Entanglement detection with near-zero cost Open
Recent research on parallel functional programming has culminated in a provably efficient (in work and space) parallel memory manager, which has been incorporated into the MPL (MaPLe) compiler for Parallel ML and shown to deliver practical…
View article: DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism
DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism Open
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-fly" determination of dependencies between sequential and par…
View article: Parallel block-delayed sequences
Parallel block-delayed sequences Open
Programming languages using functions on collections of values, such as map, reduce, scan and filter, have been used for over fifty years. Such collections have proven to be particularly useful in the context of parallelism because such fu…
View article: Provably space-efficient parallel functional programming
Provably space-efficient parallel functional programming Open
Because of its many desirable properties, such as its ability to control effects and thus potentially disastrous race conditions, functional programming offers a viable approach to programming modern multicore computers. Over the past deca…
View article: Parallel Batch-dynamic Trees via Change Propagation
Parallel Batch-dynamic Trees via Change Propagation Open
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. Dynamic trees are a fundamental building block of a large number…
View article: Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. Open
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. Dynamic trees are a fundamental building block of a large number…
View article: Disentanglement in nested-parallel programs
Disentanglement in nested-parallel programs Open
Nested parallelism has proved to be a popular approach for programming the rapidly expanding range of multicore computers. It allows programmers to express parallelism at a high level and relies on a run-time system and a scheduler to deli…
View article: Fairness in responsive parallelism
Fairness in responsive parallelism Open
Research on parallel computing has historically revolved around compute-intensive applications drawn from traditional areas such as high-performance computing. With the growing availability and usage of multicore chips, applications of par…
View article: Brief Announcement
Brief Announcement Open
International audience