Abstract:
The paper is dedicated to the problem of algorithms transformation for parallelization and improving of data locality. Piece-wise affine scheduling functions are introduced. Formal constraints which these functions are to satisfy are investigated.