376 search results - page 36 / 76 » Optimizing Pattern Matching Compilation by Program Transform... |
ASPLOS
2006
ACM
15 years 5 months ago
2006
ACM
Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at ex...
110
click to vote
ASPLOS
2004
ACM
15 years 5 months ago
2004
ACM
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...
168
click to vote
ENTCS
2002
14 years 11 months ago
2002
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
105
click to vote
IEEEPACT
1998
IEEE
15 years 4 months ago
1998
IEEE
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
105
click to vote
ENTCS
2002
14 years 11 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...