A study of pointer aliasing for software pipelining using run-time disambiguation

  • Authors:
  • Bogong Su;Stanley Habib;Wei Zhao;Jian Wang;Youfeng Wu

  • Affiliations:
  • Dept. of Computer Science, The College of Staten, Island NY;The Graduate School CUNY;Dept. of CES, Case Western Reserve University;Institut fur Computersprachen, Technische Universitat Wien;Sequent Computer Systems, Inc.

  • Venue:
  • MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.