Our project is concerned with the automatic parallelization of Mercury programs. Mercury is a purely-declarative logic programming language, this makes it easy to determine whether a set of computations may be performed in parallel with one-anther. However, the problem of how to determine which computations should be executed in parallel in order to make the program perform optimally is unsolved. Therefore, our work concentrates on building a profiler-feedback automatic parallelization system for Mercury that creates programs with very good parallel performance with as little help from the programmer as possible
We report on a detailed study of the application and eectiveness of program analysis based on abstra...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
We report on a detailed study of the application and effectiveness of program analysis based on abst...
© 2012 Dr. Paul BoneMulticore computing is ubiquitous, so programmers need to write parallel program...
Parallel implementations of programming languages need to control synchronization overheads. Synchro...
Computational scientists are typically not expert programmers, and thus work in easy to use dynamic ...
We present new algorithms which perform automatic parallelization via source-to-source transformatio...
Characteristics of full applications found in scientific computing industries today lead to challeng...
A framework for the automatic parallelization of (constraint) logic programs is proposed and proved ...
It is common for parallel applications to require a large number of threads of control, often much l...
The &-Prolog system, a practical implementation of a parallel execution niodel for Prolog exploitin...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
In recent years, manufacturers of processors are focusing on parallel architectures in order to incr...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
We report on a detailed study of the application and eectiveness of program analysis based on abstra...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
We report on a detailed study of the application and effectiveness of program analysis based on abst...
© 2012 Dr. Paul BoneMulticore computing is ubiquitous, so programmers need to write parallel program...
Parallel implementations of programming languages need to control synchronization overheads. Synchro...
Computational scientists are typically not expert programmers, and thus work in easy to use dynamic ...
We present new algorithms which perform automatic parallelization via source-to-source transformatio...
Characteristics of full applications found in scientific computing industries today lead to challeng...
A framework for the automatic parallelization of (constraint) logic programs is proposed and proved ...
It is common for parallel applications to require a large number of threads of control, often much l...
The &-Prolog system, a practical implementation of a parallel execution niodel for Prolog exploitin...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
In recent years, manufacturers of processors are focusing on parallel architectures in order to incr...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
We report on a detailed study of the application and eectiveness of program analysis based on abstra...
Automatic parallelization techniques for finding loop-based parallelism fail to find efficient paral...
We report on a detailed study of the application and effectiveness of program analysis based on abst...