Skip to main navigation Skip to search Skip to main content

Iterational retiming: Maximize iteration-level parallelism for nested loops

  • Chun Xue
  • , Zili Shao
  • , Meilin Liu
  • , Edwin H.-M. Sha

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP) applications. It is important to study effective and efficient transformation techniques to increase parallelism for nested loops. In this paper, we propose a novel technique, iterational retiming, that can satisfy any given timing constraint by achieving full parallelism for iterations in a partition. Theorems and efficient algorithms are proposed for iterational retiming. The experimental results show that iterational retiming is a promising technique for parallel embedded systems. It can achieve 87% improvement over software pipelining and 88% improvement over loop unfolding on average. Copyright 2005 ACM.
Original languageEnglish
Title of host publicationCODES+ISSS 2005 - International Conference on Hardware/Software Codesign and System Synthesis
Pages309-314
Publication statusPublished - 2005
Externally publishedYes
Event3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and Systems Synthesis CODES+ISSS 2005 - Jersey City, NJ, United States
Duration: 18 Sept 200521 Sept 2005

Conference

Conference3rd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and Systems Synthesis CODES+ISSS 2005
PlaceUnited States
CityJersey City, NJ
Period18/09/0521/09/05

Research Keywords

  • Nested Loops
  • Optimization
  • Partition
  • Retiming

Fingerprint

Dive into the research topics of 'Iterational retiming: Maximize iteration-level parallelism for nested loops'. Together they form a unique fingerprint.

Cite this