Parallelizing synchronous data-flow graphs via retiming

MaRDI QIDQ2751882zbMATH OpenFDO

Authors Timothy W. O'Neil, Sissades Tongsima, Edwin H.-M. Sha

Publication date 21 October 2001

zbMATH Keywords

synchronous data-flow graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Combining extended retiming and unfolding for rate-optimal graph transformation
• Retiming synchronous circuitry
• Understanding retiming through maximum average-delay cycles
• Uniprocessor scheduling of real-time synchronous dataflow tasks
• scientific article; zbMATH DE number 918595

Cited in

(10)

• The partitioning of QSDF computation graphs
• An efficient algorithm for delay buffer minimization
• Intermediate representations for design automation of multiprocessor DSP systems
• Combining extended retiming and unfolding for rate-optimal graph transformation
• Resynchronization for multiprocessor DSP systems
• scientific article; zbMATH DE number 1751894 (Why is no real title available?)
• scientific article; zbMATH DE number 918595 (Why is no real title available?)
• Extended synchronous dataflow for efficient DSP system prototyping
• Using fixed-point semantics to prove retiming lemmas
• Uniprocessor scheduling of real-time synchronous dataflow tasks

This page was built for publication: Parallelizing synchronous data-flow graphs via retiming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2751882)