Loop Parallelization in the Polytope Model, CONCUR’93 http://portal.acm.org/citation.cfm?id=703499 He showed how to use a polyhedral model in generating parallel codes from sequential codes by giving a concrete example.
Muthu Manikandan
A compiler framework for optimization of affine loop nests for gpgpus, ICS’08 http://portal.acm.org/citation.cfm?id=1375527.1375562 They showed the characteristics of CUDA such as a coalescing when access the global memory and a bank conflict when access the shared memory. They derived the best
Louis-Noel Pouchet
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time, CGO’07 http://portal.acm.org/citation.cfm?id=1252537 They made polyhedral models from a sequential program using a method that Paul Feautrier proposed in 1992. Many schedules could come from the polyhedral model, thus they choose only the legal