Determining I/O lower bounds is a crucial step in obtaining communication-efficient parallel
algorithms, both across the memory hierarchy and between processors. Current approaches …

Currently, a major bottleneck for several scientific computations is communication, both
communication between different processors, so-called horizontal communication, and …

Researchers and practitioners have for long worked on improving the computational
complexity of algorithms, focusing on reducing the number of operations needed to perform …

The well-studied red-blue pebble game models the execution of an arbitrary computational
DAG by a single processor over a two-level memory hierarchy. We present a natural …

Technology trends will cause data movement to account for the majority of energy
expenditure and execution time on emerging computers. Therefore, computational …

The impending termination of Moore's law motivates the search for new forms of computing
to continue the performance scaling we have grown accustomed to. Among the many …

Convolution is the most time-consuming part in the computation of convolutional neural
networks (CNNs), which have achieved great successes in numerous practical applications …

Data movements between different levels of a memory hierarchy (I/Os) are a principal
performance bottleneck. This is particularly noticeable in computations that have low …

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 …

Red-blue pebble games model the computation cost of a two-level memory hierarchy. We
present various hardness results in different red-blue pebbling variants, with a focus on the …