3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DC2023
The best multicore-parallelization refactoring you've never heard of
Mike Rainey
In this short paper, we explore a new way to refactor a simple but tricky-to-parallelize tree-traversal algorithm to harness multicore parallelism. Crucially, the refactoring draws…
cs.PL2021
Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations
Chaitanya Koparkar, Mike Rainey, Michael Vollmer +2
Recent work showed that compiling functional programs to use dense, serialized memory representations for recursive algebraic datatypes can yield significant constant-factor speedu…
cs.DC2017★ 3 cited
Parallel Work Inflation, Memory Effects, and their Empirical Analysis
Umut A. Acar, Arthur Charguéraud, Mike Rainey
In this paper, we propose an empirical method for evaluating the performance of parallel code. Our method is based on a simple idea that is surprisingly effective in helping to ide…