314 search results - page 9 / 63 » Reducing Parallel Overheads Through Dynamic Serialization |
112
click to vote
PVLDB
2008
14 years 11 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...
125
click to vote
PPOPP
2012
ACM
13 years 7 months ago
2012
ACM
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
EWC
2008
14 years 11 months ago
2008
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dyn...
83
Voted
CLUSTER
2004
IEEE
15 years 3 months ago
2004
IEEE
Cluster Storage Systems where storage devices are distributed across a large number of nodes are able to reduce the I/O bottleneck problems present in most centralized storage sys...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...