142 search results - page 2 / 29 » A Constant Propagation Algorithm for Explicitly Parallel Pro... |
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
ESOP
2008
Springer
13 years 7 months ago
2008
Springer
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
WCRE
2003
IEEE
13 years 11 months ago
2003
IEEE
Our research goal is to retarget image processing programs written in sequential languages (e.g., C) to architectures with data-parallel processing capabilities. Image processing ...
IJPP
2010
13 years 4 months ago
2010
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
PPOPP
2012
ACM
12 years 1 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...