835 search results - page 32 / 167 » On optimal slicing of parallel programs |
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
CC
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. How can we exploit a microprocessor as efficiently as possible? The “classic” approach is static optimization at compile-time, optimizing a program for all possible u...
SIGMOD
2009
ACM
14 years 2 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
PVLDB
2008
13 years 7 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
CCGRID
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...