Optimal software pipelining of nested loops

Document Type

Conference Proceeding

Publication Date

1-1-1994

Abstract

This paper presents an approach to software pipelining of nested loops. While several papers have addressed software pipelining of single (non-nested) loops, little work has been done in the area of applying it to nested loops. This paper solves the problem of finding the minimum iteration initiation interval (in the absence of resource constraints) for each level of a nested loop. The problem is formulated as one of finding a rational quasi-affine schedule for each statement in the body of a perfectly nested loop which is then solved using linear programming. This allows us to treat iteration-dependent statement reordering and multidimensional loop unrolling in the same framework. Unlike most work in scheduling nested loops, we treat each statement in the body as a unit of scheduling.

Publication Source (Journal or Book title)

Proceedings of the International Conference on Parallel Processing

First Page

335

Last Page

342

This document is currently not available here.

Share

COinS