6939 search results - page 387 / 1388 » Algorithm Engineering for Parallel Computation |
118
click to vote
KBSE
2010
IEEE
15 years 2 months ago
2010
IEEE
During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because existing p...
156
click to vote
EGH
2010
Springer
15 years 1 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
166
Voted
HPCA
1998
IEEE
15 years 8 months ago
1998
IEEE
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
114
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Parallel programming is facilitated by constructs which, unlike the widely used SPMD paradigm, provide programmers with a global view of the code and data structures. These constr...
111
click to vote
PPOPP
2006
ACM
15 years 9 months ago
2006
ACM
Tiling has proven to be an effective mechanism to develop high performance implementations of algorithms. Tiling can be used to organize computations so that communication costs i...