Click here for full text:
Automatically Pipelining Loop Iterations on Distributed-Memory Machines
Offner, Carl D.
HPL-2005-176
Keyword(s): dependence analysis; compiler optimizations; High Performance Fortran; HPF; parallelism; distributed memory
Abstract: This paper really has two parts: 1. We start with an expository discussion of LU decomposition, including a motivation as well as a clean derivation of the standard algorithm. 2. Then we show how a clever HPF compiler could infer--simply from the HPF data mapping directives--that the outer loop can be pipelined. This inference is made possible by an extension of the ordinary notion of dependence to include what are here called spatial dependences.
31 Pages
Back to Index
| 
Printable version
