Properties and algorithms for unfolding of probabilistic data-flow graphs

DOI10.1023/A:1008187622838MaRDI QIDQ1584051zbMATHOpenAlexFDO

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

Publication date 6 February 2001

Published in Journal of VLSI signal processing systems for signal, image and video technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008187622838

zbMATH Keywords

probabilistic data-flow graphselection statement

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Combining extended retiming and unfolding for rate-optimal graph transformation
• scientific article; zbMATH DE number 2059843
• scientific article; zbMATH DE number 1693487
• Probabilistic data flow analysis: a linear equational approach
• Scheduling Conditional Task Graphs

Cited in

(2)

• Combining extended retiming and unfolding for rate-optimal graph transformation
• On the detection of unstructuredness in flowgraphs

This page was built for publication: Properties and algorithms for unfolding of probabilistic data-flow graphs

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