We investigate the problem of partitioning the vertices of a directed acyclic graph into a
given number of parts. The objective function is to minimize the number or the total weight of …

In-memory computing (IMC) with cross-point resistive memory arrays has been shown to
accelerate data-centric computations, such as the training and inference of deep neural …

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 …

Data movement limits program performance. This bottleneck is more significant in multi-
thread programs but more difficult to analyze, especially for multiple thread counts. For …

High-level synthesis (HLS) can greatly facilitate the description of complex hardware
implementations, by raising the level of abstraction up to a classical imperative language …

Finding a good partition of a computational directed acyclic graph associated with an
algorithm can help find an execution pattern improving data locality, conduct an analysis of …

Evaluating the complexity of an algorithm is an important step when develo**
applications, as it impacts both its time and energy performance. Computational complexity …

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

High-level synthesis, source-to-source compilers, and various Design Space Exploration
techniques for pragma insertion have significantly improved the Quality of Results of …

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 …