For more than thirty years, the parallel programming community has used the dependence
graph as the main abstraction for reasoning about and exploiting parallelism in" regular" …

Thread-Level Speculation (TLS) is a promising technique that allows the parallel execution
of sequential code without relying on a prior, compile-time-dependence analysis. In this …

There is growing interest in using GPUs to accelerate graph algorithms such as breadth-first
search, computing page-ranks, and finding shortest paths. However, these algorithms do not …

Outside of computational science, most problems are formulated in terms of irregular data
structures such as graphs, trees and sets. Unfortunately, we understand relatively little about …

Graphics processing units provide a large computational power at a very low price which
position them as an ubiquitous accelerator. General purpose programming on the graphics …

Inclusion-based points-to analysis provides a good trade-off between precision of results
and speed of analysis, and it has been incorporated into several production compilers …

Fine-grained data parallelism is increasingly common in mainstream processors in the form
of longer vectors and on-chip GPUs. This paper develops support for exploiting such data …

Although GPGPUs are traditionally used to accelerate workloads with regular control and
memory-access structure, recent work has shown that GPGPUs can also achieve significant …

As transistor scaling is slowing down [1], other opportunities for ensuring continuous
performance increase have to be explored. Field programmable gate arrays (FPGAs) are in …

We have implemented an FPGA routing algorithm on a shared memory multi-processor
using the Galois API, which offers speculative parallelism in software. The router is a parallel …