Managing Latency and Buffer Requirements in Processing Graph Chains

DOI10.1093/comjnl/44.6.486zbMath1006.94516OpenAlexW1999828800MaRDI QIDQ4551639

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

scheduling theorysignal processinglatencymemory requirementsprocessing graph method

Mathematics Subject Classification ID

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

Related Items (3)

Self-timed scheduling analysis for real-time applications ⋮ Q-SCA: incorporating QoS support into software communications architecture for SDR waveform processing ⋮ Global control of robotic highway safety markers: a real-time solution

Uses Software

• Ptolemy

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