79 search results - page 1 / 16 » Simplification of Array Access Patterns for Compiler Optimiz... |
PLDI
1998
ACM
13 years 9 months ago
1998
ACM
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
Despite continued innovations in design of I/O systems, I/O performance has not kept pace with the progress in processor and communication technology. This paper addresses this I/...
20
Voted
LCPC
1994
Springer
13 years 9 months ago
1994
Springer
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
CGO
2008
IEEE
13 years 11 months ago
2008
IEEE
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
CL
2000
Springer
13 years 8 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...