Sciweavers

291 search results - page 6 / 59
» Dynamic Memory Allocation for Large Query Execution
Sort
View
104
Voted
IPPS
2006
IEEE
15 years 7 months ago
A simulator for parallel applications with dynamically varying compute node allocation
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...
Basile Schaeli, B. Gerlach, Roger D. Hersch
128
Voted
NIPS
1996
15 years 3 months ago
Predicting Lifetimes in Dynamically Allocated Memory
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...
David A. Cohn, Satinder P. Singh
129
Voted
PPOPP
1999
ACM
15 years 6 months ago
Automatic Parallelization of Divide and Conquer Algorithms
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...
Radu Rugina, Martin C. Rinard
ACPC
1999
Springer
15 years 6 months ago
Asynchronous Parallel Construction of Recursive Tree Hierarchies
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...
Dirk Bartz, Wolfgang Straßer
SIGMOD
2007
ACM
124views Database» more  SIGMOD 2007»
16 years 1 months ago
Query suspend and resume
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...
Badrish Chandramouli, Christopher N. Bond, Shivnat...