Full Parallelism in Uniform Nested Loops Using Multi-Dimensional Retiming

  • Authors:
  • Nelson Luiz Passos;Edwin Hsing-Mean Sha

  • Affiliations:
  • University of Notre Dame, USA;University of Notre Dame, USA

  • Venue:
  • ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most scientific and DSP applications are recursive or iterative. Uniform nested loops can be modeled as multi-dimensional data flow graphs (DFGs). To achieve full parallelism of the loop body, i.e., all the computational nodes executed in parallel, substantially decreases the overall computation time. It is well known that for one-dimensional DFGs retiming can not always achieve full parallelism. This paper shows an important and counter-intuitive result, which proves that we can always obtain full-parallelism for DFGs with more than one dimension. It also presents two novel multi-dimensional retiming techniques to obtain full parallelism.