a study of pointer aliasing for software pipelining using run-time disambiguation
Run-time Alias Disambiguation (RTD) has been proposed as a technique for pointer aliasing. This paper suggests several RTD approaches which may be used for DOACROSS scheduling to exploit coarse-grained parallelism. We analyze the rerollability problem in the transformation of those RTD approaches to software pipelining in order to exploit the instruction level parallelism available in loops. Finally, we give some suggestions as to how to address the rerollability problem.
pointer aliasing software pipelining run-time disambiguation rerollability compensation code