16 search results - page 1 / 4 » Towards automatic parallelization of tree reductions in dyna... |
SPAA
2006
ACM
13 years 10 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...
CP
2010
Springer
13 years 2 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
SODA
2004
ACM
13 years 5 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...