291 search results - page 13 / 59 » A Parallel BSP Algorithm for Irregular Dynamic Programming |
102
click to vote
ISPAN
1996
IEEE
15 years 6 months ago
1996
IEEE
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
127
Voted
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
106
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present preliminary results of a project to create a tuning system that adaptively optimizes programs to the underlying execution platform. We will show initial results from tw...
171
click to vote
LCTRTS
2001
Springer
15 years 6 months ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
116
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...