Many automatic software parallelization systems have been proposed in the past decades,
but most of them are dedicated to source-to-source transformations. This paper shows that …

In this paper, we present a dynamic compilation system called ExanaDBT for transparently
optimizing and parallelizing binaries at runtime based on the polyhedral model. Starting …

The computing landscape has been increasingly characterized by processor architectures
with increasing core counts, while a majority of the software applications remain inherently …

We present an architecture designed to transparently and automatically scale the
performance of sequential programs as a function of the hardware resources available. The …

Efficiently executing sequential legacy binaries on chip multi-processors (CMPs) composed
of many, small cores is one of today's most pressing problems. Single-threaded execution is …

Caching is a well-known technique for speeding up computation. We cache data from file
systems and databases; we cache dynamically generated code blocks; we cache page …

Prior work on Automatically Scalable Computation (ASC) suggests that it is possible to
parallelize sequential computation by building a model of whole-program execution, using …

Today, nearly all general-purpose computers are parallel, but nearly all software running on
them is serial. Bridging this disconnect by manually rewriting source code in parallel is …

With the multicore trend, the need for automatic parallelization is more pronounced,
especially for legacy and proprietary code where no source code is available and/or the …

Binary rewriting is the foundation of a wide range of binary analysis tools and techniques,
including securing untrusted code, enforcing control-flow integrity, dynamic optimization …