Sciweavers

164 search results - page 9 / 33
» Precise Data Locality Optimization of Nested Loops
Sort
View
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
14 years 21 days ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...
IFL
2005
Springer
107views Formal Methods» more  IFL 2005»
14 years 1 months ago
With-Loop Fusion for Data Locality and Parallelism
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...
Clemens Grelck, Karsten Hinckfuß, Sven-Bodo ...
IPPS
1998
IEEE
13 years 12 months ago
Compiler-Optimization of Implicit Reductions for Distributed Memory Multiprocessors
This paper presents reduction recognition and parallel code generationstrategies for distributed-memorymultiprocessors. We describe techniques to recognize a broad range of implic...
Bo Lu, John M. Mellor-Crummey
PC
1998
153views Management» more  PC 1998»
13 years 7 months ago
Compilation Techniques for Out-of-Core Parallel Computations
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
PLDI
2010
ACM
14 years 5 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger