Sciweavers

26 search results - page 1 / 6
» Cache-Friendly implementations of transitive closure
Sort
View
64
Voted
JEA
2006
83views more  JEA 2006»
14 years 9 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
IPPS
2002
IEEE
15 years 2 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
VLDB
1993
ACM
98views Database» more  VLDB 1993»
15 years 1 months ago
Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB
Maurice A. W. Houtsma, Annita N. Wilschut, Jan Flo...
SARA
2009
Springer
15 years 3 months ago
Tightened Transitive Closure of Integer Addition Constraints
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
Peter Z. Revesz
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
15 years 4 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif