177 search results - page 19 / 36 » Minimal Data Dependence Abstractions for Loop Transformation... |
LCPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
LCPC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Empirical optimizers like ATLAS have been very effective in optimizing computational kernels in libraries. The best choice of parameters such as tile size and degree of l...
107
Voted
PLDI
2011
ACM
14 years 14 days ago
2011
ACM
Software modifications are often systematic—they consist of similar, but not identical, program changes to multiple contexts. Existing tools for systematic program transformati...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
MPC
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...