General purpose Gpus provide massive compute power, but are notoriously difficult to
program. In this paper we present a complete compilation strategy to exploit Gpus for the …

Execution-driven data dependence profiling has gained significant interest as a tool to
compensate the weakness of static data dependence analysis. Although such dependence …

Retrofitting existing software for the increasingly dominant multicore microprocessors has a
strong appeal from the economic point of view. One of the key issues in such an effort is to …

Task-based parallel programming languages require the programmer to partition the
traditional sequential code into smaller tasks in order to take advantage of the existing …

Sequence alignment algorithms have recently found a use in detecting code clones,
software plagiarism, code theft, and polymorphic malware. This approach involves extracting …

Divide-and-conquer algorithms appear in the solution of many computationally intensive
problems, and are good candidates for parallelization. A divide-and-conquer computation …

We propose program analyses to identify parallelizable code fragments, and program
transformations to change those fragments into applications of high-level parallel patterns …

This paper presents a methodology and framework designed to assist students in the
process of finding appropriate task decomposition strategies for their sequential program, as …

The free lunch of ever increasing clock frequencies is over. Performance-critical sequential
software must be parallelized, and this is tedious, hard, buggy, knowledge-intensive, and …

The multicore era has increased the need for highly parallel software. Since automatic
parallelization turned out ineffective for many production codes, the community hopes for the …