Analysis of dataflow programs with interval-limited data-rates

DOI10.1007/S11265-006-7274-2MaRDI QIDQ2432195zbMATH OpenOpenAlexFDO

Authors Jürgen Teich, Shuvra S. Bhattacharyya

Publication date 25 October 2006

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.1007/s11265-006-7274-2

zbMATH Keywords

buffer memory analysisinterval ratesScheduling dataflow models of computation

Mathematics Subject Classification ID

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

Recommendations

• Worst-case throughput analysis for parametric rate and parametric actor execution time scenario-aware dataflow graphs
• Applying real-time scheduling theory to the synchronous data flow model of computation
• Performance model checking scenario-aware dataflow
• Uniprocessor scheduling of real-time synchronous dataflow tasks
• Data-flow frameworks for worst-case execution time analysis

Cites work

• scientific article; zbMATH DE number 432514 (Why is no real title available?)
• scientific article; zbMATH DE number 918595 (Why is no real title available?)
• Parameterized dataflow modeling for DSP systems

Cited in

(4)

• Exploiting the expressiveness of cyclo-static dataflow to model multimedia implementations
• Worst-case throughput analysis for parametric rate and parametric actor execution time scenario-aware dataflow graphs
• scientific article; zbMATH DE number 2079646 (Why is no real title available?)
• A data flow model with frequency arithmetic

This page was built for publication: Analysis of dataflow programs with interval-limited data-rates

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