Sciweavers

167 search results - page 13 / 34
» An Algebraic Framework for Optimizing Parallel Programs
Sort
View
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
IPPS
2008
IEEE
14 years 1 months ago
Lattice Boltzmann simulation optimization on leading multicore platforms
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...
Samuel Williams, Jonathan Carter, Leonid Oliker, J...
MICRO
2010
IEEE
175views Hardware» more  MICRO 2010»
13 years 5 months ago
Efficient Selection of Vector Instructions Using Dynamic Programming
Accelerating program performance via SIMD vector units is very common in modern processors, as evidenced by the use of SSE, MMX, VSE, and VSX SIMD instructions in multimedia, scien...
Rajkishore Barik, Jisheng Zhao, Vivek Sarkar
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 7 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay