Managing Latency and Buffer Requirements in Processing Graph Chains

DOI10.1093/COMJNL/44.6.486MaRDI QIDQ4551639zbMATH OpenOpenAlexFDO

Authors Steve Goddard, Kevin Jeffay

Publication date 9 March 2003

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5e292d2bef2d64b0f5dc1ae9a54ce62a70e51792

zbMATH Keywords

latencymemory requirementsprocessing graph methodscheduling theorysignal processing

Mathematics Subject Classification ID

Applications of graph theory (05C90) Theory of software (68N99) Stochastic scheduling theory in operations research (90B36) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
• Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
• Buffer management for packets with processing times
• scientific article; zbMATH DE number 3499620
• Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks
• Exploiting Buffered Updates for Fast Streaming Graph Analysis

Cited in

(4)

• Q-SCA: incorporating QoS support into software communications architecture for SDR waveform processing
• scientific article; zbMATH DE number 1360851 (Why is no real title available?)
• Global control of robotic highway safety markers: a real-time solution
• Self-timed scheduling analysis for real-time applications

Describes a project that uses

Uses Software

• Ptolemy

This page was built for publication: Managing Latency and Buffer Requirements in Processing Graph Chains

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