The linear algebraic geometry of programs
For a number of years, we have been using tools from linear algebra to
model, analyze, transform, parallelize and compile a class of equational
programs (i.e., programs written as equations), those with affine dependences,
defined over polyhedral domains, and with "reduction"
operations. In this talk, I will first describe these equations, the
transformations we can apply to them and their closure properties. Then I
will describe an analysis problem of great practical interest: finding a
schedule for the computations in a program.
Sanjay
Rajopadhye
| Mail: svr@cs.colostate.edu
Computer Science Department | Home: http://www.cs.colostate.edu/~svr
Colorado State University | Fone: (970)
491-7323
Fort Collins CO, USA 80523-1873 | Phax: (970) 491-2466