291 search results - page 6 / 59 » Dynamic Memory Allocation for Large Query Execution |
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
107
click to vote
NIPS
1996
15 years 28 days ago
1996
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
106
click to vote
PPOPP
1999
ACM
15 years 3 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
117
click to vote
ACPC
1999
Springer
15 years 3 months ago
1999
Springer
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of the...
155
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...