6004 search results - page 975 / 1201 » Parallelizing query optimization |
183
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
195
click to vote
ARC
2012
Springer
13 years 10 months ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
126
click to vote
EVOW
2012
Springer
13 years 10 months ago
2012
Springer
We are using bandit-based adaptive operator selection while autotuning parallel computer programs. The autotuning, which uses evolutionary algorithm-based stochastic sampling, take...
165
click to vote
HPDC
2012
IEEE
13 years 4 months ago
2012
IEEE
Applications often involve iterative execution of identical or slowly evolving calculations. Such applications require incremental rebalancing to improve load balance across itera...
131
click to vote
LCPC
2007
Springer
15 years 8 months ago
2007
Springer
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...