Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs, or programming support to write explicitly parallel query programs. In this paper, we present compiler analysis to automatically detect parallelism in the embedded query programs. We present compiler dependence test algorithms for detecting both internal and external dependences. We show that the properties of some special functions such as MIN and MAX can help reduce depend...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
International audienceThis paper describes a tool using one or more executions of a sequential progr...
AND-parallel execution of logic programs turns out to be an intricate matter whenever clause literal...
In the current work, we derive a complete approach to optimization and automatic parallelization of ...
A parallelizing compiler relies on data dependence analysis to detect independent operations in a us...
International audienceDefinition : The goal of parallel query execution is minimizing query response...
Finding parallelism that exists in a software program depends a great deal on determining the depend...
Data dependence analysis techniques are the main component of today's strategies for automatic ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
Dependence analysis is an essential step for many compiler optimizations, from simple loop transform...
A simple run-time data dependence test is presented which is based on a new formulation of the depen...
The optimization of programs with explicit--i.e. user specified--parallelism requires the computatio...
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs....
results for an unlimited number of processors. Upper and lower bounds of the inherent parallelism, f...
In this final project, we present an approach for optimizing and parallelizing the query execution f...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
International audienceThis paper describes a tool using one or more executions of a sequential progr...
AND-parallel execution of logic programs turns out to be an intricate matter whenever clause literal...
In the current work, we derive a complete approach to optimization and automatic parallelization of ...
A parallelizing compiler relies on data dependence analysis to detect independent operations in a us...
International audienceDefinition : The goal of parallel query execution is minimizing query response...
Finding parallelism that exists in a software program depends a great deal on determining the depend...
Data dependence analysis techniques are the main component of today's strategies for automatic ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2012.Speculative parallelizatio...
Dependence analysis is an essential step for many compiler optimizations, from simple loop transform...
A simple run-time data dependence test is presented which is based on a new formulation of the depen...
The optimization of programs with explicit--i.e. user specified--parallelism requires the computatio...
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs....
results for an unlimited number of processors. Upper and lower bounds of the inherent parallelism, f...
In this final project, we present an approach for optimizing and parallelizing the query execution f...
Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to...
International audienceThis paper describes a tool using one or more executions of a sequential progr...
AND-parallel execution of logic programs turns out to be an intricate matter whenever clause literal...