Rate-Optimal Graph Transformation via Extended Retiming and Unfolding �

  title={Rate-Optimal Graph Transformation via Extended Retiming and Unfolding �},
  author={Timothy W. O’Neil and Edwin Hsing-Mean Sha},
Many computation-intensi ve iterative or recursi ve applicationscommonly found in digital signalprocessingand imageprocessingapplicationscanberepresentedby data-flowgraphs(DFGs). Theexecutionof all tasksof a DFG is calledan iteration, with the averagecomputation timeof aniterationtheiterationperiod. A greatdealof researchhasbeen doneattemptingto optimizesuchapplicationsby applyingvariousgraph transformationtechniquesto theDFG in orderto minimizethis iteration period.Two of… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 15 references

Combining extended retiming and unfolding for rate-optimalgraph transformation

  • T. O’Neil, E.H.-M. Sha
  • Univ. of Notre Dame,
  • 1999
Highly Influential
5 Excerpts

Sha.Schedulingdata-flow graphsvia retiming andunfolding.IEEETrans.Parallel & DistributedSyst

  • L.-F. ChaoandE.H.-M
  • 1997
Highly Influential
7 Excerpts

Sha . Extendedretiming : Optimal retimingvia a graphtheoreticalapproach

  • S. Tongsima T. O’Neil, andE. H.-M.
  • Tech . Rept
  • 1999

Sha.Extendedretiming:Optimal retimingvia a graph-theoretical approach.In Proc

  • T. O’Neil, S.Tongsima, andE.H.-M
  • vol. 4,
  • 1999
2 Excerpts

Gupta.Fastermaximumandminimummeancycle algorithmsfor system-performance analysis

  • A. DasdanandR
  • IEEE Trans.CAD of IntegratedCircuits& Syst
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…