177 search results - page 18 / 36 » Minimal Data Dependence Abstractions for Loop Transformation... |
118
click to vote
ICS
2003
Tsinghua U.
15 years 9 months ago
2003
Tsinghua U.
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
146
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
137
Voted
COSPS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Array privatization is one of the most e ective transformations for the exploitation of parallelism. In this paper, we present a technique for automatic array privatizati...
123
click to vote
MICRO
1998
IEEE
15 years 8 months ago
1998
IEEE
We present an architecture that features dynamic multithreading execution of a single program. Threads are created automatically by hardware at procedure and loop boundaries and e...
115
Voted
BIBE
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract-The aim of this work is to compare some deterministic optimization algorithms and evolutionary algorithms on parameter estimation in a biological circuit design problem: t...