Motion planning algorithms have seen considerable progress and expansion across various
domains of science and technology during the last few decades, where rapid advancements …

In this paper we develop optimal algorithms in the binary-forking model for a variety of
fundamental problems, including sorting, semisorting, list ranking, tree contraction, range …

Open Cilk is a new open-source platform to support Cilk multithreaded programming,
especially for researchers and teachers. Open Cilk aims to provide a full-featured …

Optimizing the performance of stencil algorithms has been the subject of intense research
over the last two decades. Since many stencil schemes have low arithmetic intensity, most …

This paper studies parallel algorithms for the longest increasing subsequence (LIS)
problem. Let n be the input size and k be the LIS length of the input. Sequentially, LIS is a …

Iterative stencils are used widely across the spectrum of High Performance Computing
(HPC) applications. Many efforts have been put into optimizing stencil GPU kernels, given …

Stencil computations represent a very common class of nested loops in scientific and
engineering applications. The exhaustively studied tiling is one of the most powerful …

Iterative wavefront algorithms for evaluating dynamic programming recurrences exploit
optimal parallelism but show poor cache performance. Tiled-iterative wavefront algorithms …

The nested parallel (aka fork-join) model is widely used for writing parallel programs.
However, the two composition constructs, ie"||"(parallel) and";"(serial), that comprise the …

We present Autogen—an algorithm that for a wide class of dynamic programming (DP)
problems automatically discovers highly efficient cache-oblivious parallel recursive divide …