6004 search results - page 958 / 1201 » Parallelizing query optimization |
121
click to vote
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
112
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper explains how efficient support for semiregular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work ...
114
Voted
CC
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Source code transformations are a very effective method of parallelizing and improving the efficiency of programs. Unfortunately most compiler systems require implementin...
115
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
111
click to vote
EUROPAR
1999
Springer
15 years 6 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...