Abstract
In this paper we present a new class of loop optimizing transformations called valid transformations. This class of transformations are different from existing ones in that valid transformations can be illegal and can result in incorrect non-pipelined designs. Nevertheless, valid transformations have feasible pipeline schedules which is important for scheduling loops. We present an example valid transformation called loop expansion which can help explore a larger design space and helps in producing cost-performance efficient designs. Several examples are used to demonstrate the efficacy of the proposed transformations.
Original language | English |
---|---|
Article number | 5727756 |
Pages (from-to) | II20-II23 |
Journal | Proceedings of the International Conference on Parallel Processing |
Volume | 2 |
DOIs | |
State | Published - 1994 |
Event | 23rd International Conference on Parallel Processing, ICPP 1994 - Raleigh, NC, United States Duration: 15 Aug 1994 → 19 Aug 1994 |